On the public citation graph

Implementing scheduling algorithms in high-speed networks

0 signed · 136 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/90.234856openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
inferredcites →https://doi.org/10.1109/90.477727openalex-snapshot
Making greed work in networks: a game-theoretic analysis of switch service disciplines
inferredcites →https://doi.org/10.1109/90.502236openalex-snapshot
Efficient fair queuing using deficit round-robin
inferredcites →https://doi.org/10.1109/90.649569openalex-snapshot
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
inferredcites →https://doi.org/10.1109/90.842141openalex-snapshot
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
inferredcites →https://doi.org/10.1109/icccn.1995.540168openalex-snapshot
Scheduling for quality of service guarantees via service curves
inferredcites →https://doi.org/10.1109/icnp.1997.643677openalex-snapshot
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks
inferredcites →https://doi.org/10.1109/infcom.1994.337677openalex-snapshot
A self-clocked fair queueing scheme for broadband applications
inferredcites →https://doi.org/10.1109/infcom.1996.493065openalex-snapshot
Scalability issues for distributed explicit rate allocation in ATM networks
inferredcites →https://doi.org/10.1109/infcom.1996.493359openalex-snapshot
Hardware-efficient fair queueing architectures for high-speed networks
inferredcites →https://doi.org/10.1109/infcom.1996.497885openalex-snapshot
WF/sup 2/Q: worst-case fair weighted fair queueing
inferredcites →https://doi.org/10.1109/infcom.1997.635151openalex-snapshot
A general methodology for designing efficient traffic scheduling and shaping algorithms
inferredcites →https://doi.org/10.1109/real.1996.563725openalex-snapshot
A proportional share resource allocation algorithm for real-time, time-shared systems
inferredcites →https://doi.org/10.1145/115992.115995openalex-snapshot
A control-theoretic approach to flow control
inferredcites →https://doi.org/10.1145/144179.144225openalex-snapshot
Architecture design for regulating and scheduling user's traffic in ATM networks
inferredcites →https://doi.org/10.1145/205447.205463openalex-snapshot
A control-theoretic approach to flow control
inferredcites →https://doi.org/10.1145/217391.217453openalex-snapshot
Efficient fair queueing using deficit round robin
inferredcites →https://doi.org/10.1145/233008.233030openalex-snapshot
Design and analysis of frame-based fair queueing
inferredcites →https://doi.org/10.1145/248156.248170openalex-snapshot
Hierarchical packet fair queueing algorithms
inferredcites →https://doi.org/10.1145/248156.248171openalex-snapshot
Start-time fair queueing
inferredcites →https://doi.org/10.1145/248157.248170openalex-snapshot
Hierarchical packet fair queueing algorithms
inferredcites →https://doi.org/10.1145/259380.259482openalex-snapshot
Leap forward virtual clock
inferredcites →https://doi.org/10.1145/75246.75248openalex-snapshot
Analysis and simulation of a fair queueing algorithm
inferredcites →https://doi.org/10.1145/75247.75248openalex-snapshot
Analysis and simulation of a fair queueing algorithm
inferredcites →https://doi.org/10.3233/jhs-1994-3405openalex-snapshot
Rate-Controlled Service Disciplines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0470856343openalex-snapshot
Scheduling in Real‐Time Systems
inferred← citeshttps://doi.org/10.1002/dac.545openalex-snapshot
Price‐coupled scheduling for differentiated services: Gcµversus GPS
inferred← citeshttps://doi.org/10.1007/11881223_52openalex-snapshot
Probability Based Weighted Fair Queueing Algorithm with Adaptive Buffer Management for High-Speed Network
inferred← citeshttps://doi.org/10.1007/3-540-36480-3_32openalex-snapshot
DWDM for QoS Management in Optical Packet Switches
inferred← citeshttps://doi.org/10.1007/3-540-44554-4_14openalex-snapshot
Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks
inferred← citeshttps://doi.org/10.1007/3-540-44863-2_49openalex-snapshot
Architecture for Internal Communication in Multi-gigabit IP Routers
inferred← citeshttps://doi.org/10.1007/3-540-45812-3_15openalex-snapshot
Efficient Implementation of Packet Scheduling Algorithm on High-Speed Programmable Network Processors
inferred← citeshttps://doi.org/10.1007/3-540-45859-x_8openalex-snapshot
SBQ: A Simple Scheduler for Fair Bandwidth Sharing Between Unicast and Multicast Flows
inferred← citeshttps://doi.org/10.1007/3-540-47728-4_33openalex-snapshot
Performance Consideration for Building the Next Generation Multi-service Optical Communications Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-27824-5_115openalex-snapshot
Implementation of a Novel Credit Based SCFQ Scheduler for Broadband Wireless Access
inferred← citeshttps://doi.org/10.1007/978-3-540-30585-9_27openalex-snapshot
Contention Free Scheme for Asymmetrical Traffic Load in IEEE 802.11x Wireless LAN
inferred← citeshttps://doi.org/10.1007/978-3-540-45076-4_17openalex-snapshot
An Innovative Resource Management Scheme for Multi-gigabit Networking Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_7openalex-snapshot
Problems in Dynamic Bandwidth Allocation in Connection Oriented Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-56675-2_45openalex-snapshot
Service Separation and QoS in ATM Networks: The RCC+ Multiplexer
inferred← citeshttps://doi.org/10.1007/b97828openalex-snapshot
Stateless Core: A Scalable Approach for Quality of Service in the Internet: Winning Thesis of the 2001 ACM Doctoral Dissertation Competition
inferred← citeshttps://doi.org/10.1016/j.comcom.2003.08.006openalex-snapshot
Fair bandwidth sharing between unicast and multicast flows in best-effort networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2005.04.002openalex-snapshot
An evaluation of fair packet schedulers using a novel measure of instantaneous fairness
inferred← citeshttps://doi.org/10.1016/j.comcom.2014.04.009openalex-snapshot
Reducing the execution time of fair-queueing packet schedulers
inferred← citeshttps://doi.org/10.1016/j.comcom.2015.06.009openalex-snapshot
On service guarantees of fair-queueing schedulers in real systems
inferred← citeshttps://doi.org/10.1016/j.comnet.2003.12.010openalex-snapshot
Wavelength and time domain exploitation for QoS management in optical packet switches
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.04.004openalex-snapshot
A practical fair queuing scheduler: Simplification through quantization
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2012.11.012openalex-snapshot
Design of priority-based active queue management for a high-performance IP switch
inferred← citeshttps://doi.org/10.1016/j.vlsi.2011.01.001openalex-snapshot
Fully hardware based WFQ architecture for high-speed QoS packet scheduling
inferred← citeshttps://doi.org/10.1016/s1389-1286(01)00229-8openalex-snapshot
Enhanced weighted round robin schedulers for accurate bandwidth distribution in packet networks
inferred← citeshttps://doi.org/10.1049/ip-com:20030283openalex-snapshot
Guaranteeing service rates for cell-based schedulers with a grouping architecture
inferred← citeshttps://doi.org/10.1078/1434-8411-00026openalex-snapshot
The RCC+: A Fast and Reliable Scheduler for QoS in ATM Networks through Service Separation
inferred← citeshttps://doi.org/10.1080/1206212x.2001.11441639openalex-snapshot
The Influence of Cumulative Switch Delay in Multiple Service Class Networks
inferred← citeshttps://doi.org/10.1109/49.898749openalex-snapshot
A distributed scheduling architecture for scalable packet switches
inferred← citeshttps://doi.org/10.1109/aaa-idea.2005.7openalex-snapshot
Extending WF^2 Q+ to Support a Dynamic Traffic Mix
inferred← citeshttps://doi.org/10.1109/access.2017.2767071openalex-snapshot
An Improved Quality-of-Service Performance Using RED’s Active Queue Management Flow Control in Classifying Networks
inferred← citeshttps://doi.org/10.1109/apccas.2000.913406openalex-snapshot
Hardware implementation of packet-fair queuing schedulers in high speed networks
inferred← citeshttps://doi.org/10.1109/ccece.2004.1345065openalex-snapshot
An integrated scheduling and buffer management scheme for packet-switched routers
inferred← citeshttps://doi.org/10.1109/ccece.2004.1345237openalex-snapshot
On the implementation of weighted fair queuing in high speed networks
inferred← citeshttps://doi.org/10.1109/ccnc.2004.1286842openalex-snapshot
A new priority calculation method for sorted-priority fair queuing
inferred← citeshttps://doi.org/10.1109/ftdcs.2003.1204336openalex-snapshot
Queue management for QoS provision build on network processor
inferred← citeshttps://doi.org/10.1109/glocom.1999.832472openalex-snapshot
Supporting best-effort traffic with fair service curve
inferred← citeshttps://doi.org/10.1109/glocom.2000.892058openalex-snapshot
Feedback control in a distributed scheduling architecture
inferred← citeshttps://doi.org/10.1109/glocom.2001.965890openalex-snapshot
A weighted fair queueing scheduler with decoupled bandwidth and delay guarantees for the support of voice traffic
inferred← citeshttps://doi.org/10.1109/glocom.2001.966199openalex-snapshot
A compressed and dynamic-range-based expression of timestamp and period for timestamp-based schedulers
inferred← citeshttps://doi.org/10.1109/glocom.2001.966212openalex-snapshot
Improving service rate granularity by dual-rate session grouping in cell-based schedulers
inferred← citeshttps://doi.org/10.1109/glocom.2002.1189063openalex-snapshot
Implementing the dual-rate grouping scheme in cell-based schedulers
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378282openalex-snapshot
Quantitative QoS guarantees in labeled optical burst switching networks
inferred← citeshttps://doi.org/10.1109/hpsr.2015.7483104openalex-snapshot
LAWIN: A Latency-AWare InterNet architecture for latency support on best-effort networks
inferred← citeshttps://doi.org/10.1109/icc.2001.936280openalex-snapshot
An efficient expression of timestamp and period in packet-based and cell-based schedulers
inferred← citeshttps://doi.org/10.1109/icc.2001.936948openalex-snapshot
Pipelined heap (priority queue) management for advanced scheduling in high-speed networks
inferred← citeshttps://doi.org/10.1109/icc.2002.997312openalex-snapshot
A new bandwidth sharing scheme for non-responsive multicast flows
inferred← citeshttps://doi.org/10.1109/icc.2004.1313298openalex-snapshot
Architecture and implementation of a novel tag computation circuit for broadband wireless access packet scheduling
inferred← citeshttps://doi.org/10.1109/icc.2006.254802openalex-snapshot
Design and Implementation of Hybrid Packet Scheduling Schemes with Network Processors
inferred← citeshttps://doi.org/10.1109/icccn.2013.6614175openalex-snapshot
Providing Near-Optimal Fair-Queueing Guarantees at Round-Robin Amortized Cost
inferred← citeshttps://doi.org/10.1109/icct.2000.890976openalex-snapshot
Design of packet-fair queuing schedulers in router
inferred← citeshttps://doi.org/10.1109/icnp.2002.1181412openalex-snapshot
A simple and scalable fair bandwidth sharing mechanism for multicast flows
inferred← citeshttps://doi.org/10.1109/infocom.2006.137openalex-snapshot
A Scalable Priority Queue Architecture for High Speed Network Processing
inferred← citeshttps://doi.org/10.1109/infocom.2006.268openalex-snapshot
SI-WF2Q: WF2Q Approximation with Small Constant Execution Overhead
inferred← citeshttps://doi.org/10.1109/infocom.2008.142openalex-snapshot
Design and Analysis of Hybrid Packet Schedulers
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303103openalex-snapshot
A reconfigurable tag computation architecture for terabit packet scheduling
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205899openalex-snapshot
An innovative scheduling scheme for high-speed network processors
inferred← citeshttps://doi.org/10.1109/iscc.2001.935413openalex-snapshot
A new fairness criterion and its realization by using a new scheduling algorithm in the Internet
inferred← citeshttps://doi.org/10.1109/iwqos.2000.847935openalex-snapshot
Minimum-latency dual-leaky-bucket shapers for packet multiplexers: theory and implementation
inferred← citeshttps://doi.org/10.1109/lcomm.2005.06025openalex-snapshot
Leaky-bucket shaper design based on time interval grouping
inferred← citeshttps://doi.org/10.1109/mm.2004.55openalex-snapshot
PR03: a hybrid NPU architecture
inferred← citeshttps://doi.org/10.1109/pccc.2003.1203728openalex-snapshot
An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness
inferred← citeshttps://doi.org/10.1109/pdcat.2003.1236251openalex-snapshot
A model for the integration of buffer management and packet scheduling
inferred← citeshttps://doi.org/10.1109/peits.2008.24openalex-snapshot
A Multi-Path Access Control Scheme in Core Packet Network
inferred← citeshttps://doi.org/10.1109/real.2003.1253280openalex-snapshot
Greedy fair queueing: a goal-oriented strategy for fair real-time packet scheduling
inferred← citeshttps://doi.org/10.1109/socc.2006.283896openalex-snapshot
A Scalable Packet Sorting Circuit for High-Speed WFQ Packet Scheduling
inferred← citeshttps://doi.org/10.1109/spl.2007.371723openalex-snapshot
A Buffered Crossbar-Based Chip Interconnection Architecture Supporting Quality of Service
inferred← citeshttps://doi.org/10.1109/tc.2007.1062openalex-snapshot
Design, Analysis and Implementation of a Novel Multiple Resource Scheduler
inferred← citeshttps://doi.org/10.1109/tc.2010.105openalex-snapshot
High Throughput Disk Scheduling with Fair Bandwidth Distribution
inferred← citeshttps://doi.org/10.1109/tc.2012.108openalex-snapshot
Modular Design of High-Throughput, Low-Latency Sorting Units
inferred← citeshttps://doi.org/10.1109/tc.2025.3605766openalex-snapshot
Competition-Style Sorting Networks (CSN): A Framework for Hardware-Based Sorting Operations
inferred← citeshttps://doi.org/10.1109/tcsii.2021.3058245openalex-snapshot
A Novel Scheme for Real-Time Max/Min-Set-Selection Sorters on FPGA
inferred← citeshttps://doi.org/10.1109/tit.2002.800501openalex-snapshot
File transmission over wireless fast fading downlink
inferred← citeshttps://doi.org/10.1109/tnet.2006.886287openalex-snapshot
The Stratified Round Robin Scheduler: Design, Analysis and Implementation
inferred← citeshttps://doi.org/10.1109/tnet.2007.892882openalex-snapshot
Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High-Speed Networks
inferred← citeshttps://doi.org/10.1109/tnet.2007.897967openalex-snapshot
Exact GPS Simulation and Optimal Fair Scheduling With Logarithmic Complexity
inferred← citeshttps://doi.org/10.1109/tnet.2007.909727openalex-snapshot
Design Issues in Next-Generation Merchant Switch Fabrics
inferred← citeshttps://doi.org/10.1109/tnet.2009.2033059openalex-snapshot
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
inferred← citeshttps://doi.org/10.1109/tnet.2012.2215881openalex-snapshot
QFQ: Efficient Packet Scheduling With Tight Guarantees
inferred← citeshttps://doi.org/10.1109/tpds.2007.1045openalex-snapshot
Design, Analysis, and Implementation of a Novel Low Complexity Scheduler for Joint Resource Allocation
inferred← citeshttps://doi.org/10.1109/tpds.2007.70746openalex-snapshot
Max-Min Fair Scheduling in Input-Queued Switches
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2000323openalex-snapshot
A Scalable Packet Sorting Circuit for High-Speed WFQ Packet Scheduling
inferred← citeshttps://doi.org/10.1109/tvlsi.2018.2822300openalex-snapshot
Low-Cost Sorting Network Circuits Using Unary Processing
inferred← citeshttps://doi.org/10.1109/tvlsi.2019.2912554openalex-snapshot
RTHS: A Low-Cost High-Performance Real-Time Hardware Sorter, Using a Multidimensional Sorting Algorithm
inferred← citeshttps://doi.org/10.1109/waina.2013.54openalex-snapshot
A Modular Architecture for QoS Provisioning over Wireless Links
inferred← citeshttps://doi.org/10.1109/wicom.2009.5301754openalex-snapshot
An Advanced Scheduling Algorithm in OFDM Wireless Communication Systems
inferred← citeshttps://doi.org/10.1145/1015467.1015497openalex-snapshot
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
inferred← citeshttps://doi.org/10.1145/1030194.1015497openalex-snapshot
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
inferred← citeshttps://doi.org/10.1145/1228784.1228810openalex-snapshot
A buffered crossbar-based chip interconnection framework supporting quality of service
inferred← citeshttps://doi.org/10.1145/301453.301580openalex-snapshot
Supporting best-effort traffic with fair service curve
inferred← citeshttps://doi.org/10.1145/316188.316208openalex-snapshot
Providing guaranteed services without per flow management
inferred← citeshttps://doi.org/10.1145/316194.316208openalex-snapshot
Providing guaranteed services without per flow management
inferred← citeshttps://doi.org/10.1145/345867.345872openalex-snapshot
W 2 F 2 Q
inferred← citeshttps://doi.org/10.1145/3517181openalex-snapshot
Sorting in Memristive Memory
inferred← citeshttps://doi.org/10.1145/581199.581215openalex-snapshot
System-level modeling of a network switch SoC
inferred← citeshttps://doi.org/10.1145/863955.863983openalex-snapshot
Stratified round Robin
inferred← citeshttps://doi.org/10.1166/jolpe.2012.1165openalex-snapshot
Adaptive Input-Output Selection Based On-Chip Router Architecture
inferred← citeshttps://doi.org/10.14279/depositonce-725openalex-snapshot
The Influence of Proportional Jitter Scheduling Algorithms on Differentiated Services Networks
inferred← citeshttps://doi.org/10.21236/ada461973openalex-snapshot
Prioritized Elastic Round Robin: An Efficient and Low-Latency Packet Scheduler with Improved Fairness
inferred← citeshttps://doi.org/10.23919/jcc.2019.11.012openalex-snapshot
An efficient scheduling scheme for fronthaul load reduction in fog radio access networks
inferred← citeshttps://doi.org/10.2498/cit.2004.01.01openalex-snapshot
VHDL Design of a Scalable VLSI Sorting Device Based on Pipelined Computation
inferred← citeshttps://doi.org/10.3745/kipstc.2003.10c.1.071openalex-snapshot
The software architecture for the internal data processing in Gigabit IP Router
inferred← citeshttps://doi.org/10.3745/kipstc.2005.12c.3.387openalex-snapshot
Polling Scheme Adapted to Unbalanced Traffic Load in IEEE 802.11x Wireless LAN
inferred← citeshttps://doi.org/10.3844/jcssp.2006.218.223openalex-snapshot
Design of a High-Performance IP Switching Architecture
inferred← citeshttps://doi.org/10.3844/jcssp.2014.1447.1457openalex-snapshot
A COMBINED LOW LATENCY AND WEIGHTED FAIR QUEUING BASED SCHEDULING OF AN INPUT-QUEUED SWITCH
inferred← citeshttps://doi.org/10.3929/ethz-a-004173980openalex-snapshot
Algorithm-architecture trade-offs in network processor design
inferred← citeshttps://doi.org/10.3929/ethz-a-004287169openalex-snapshot
Modeling a shared medium access node with QoS distinction
inferred← citeshttps://doi.org/10.4018/ijitn.2018010104openalex-snapshot
A Two Step Multi-Carrier Proportional Fair Scheduling Scheme for Cloud Radio Access Networks
inferred← citeshttps://doi.org/10.48456/tr-528openalex-snapshot
Measurement-based management of network resources
inferred← citeshttps://doi.org/10.70675/c396f604z6e16z43e8zb9c7z5ea36f30c1a0openalex-snapshot
Design of ultra high throughput rate NB-LDPC decoder
inferred← citeshttps://doi.org/10.7916/d8m61t4sopenalex-snapshot
Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems
inferred← citeshttps://doi.org/10.9717/kmms.2016.19.5.924openalex-snapshot
Underwater Packet Flow Control for Underwater Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.