The design philosophy of the DARPA internet protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Efficient support of delay and rate guarantees in an internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Experience with control mechanisms for packet video in the internet
ACM SIGCOMM Computer Communication Review
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Carry-over round robin: a simple cell scheduling mechanism for ATM networks
IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable compression and transmission of internet multicast video
Scalable compression and transmission of internet multicast video
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks
IEEE Communications Magazine
A new scalable service discipline for real-time traffic: The framed-deadline scheduler
Computer Communications
OCGRR: A New Scheduling Algorithm for Differentiated Services Networks
IEEE Transactions on Parallel and Distributed Systems
A new scheduling scheme for high-speed packet networks: Earliest-virtual-deadline-first
Computer Communications
A new smoothed fair scheduling algorithm based on timeslot reservation
Proceedings of the 2nd international conference on Scalable information systems
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Characterization of advanced round robin scheduler
WSEAS TRANSACTIONS on COMMUNICATIONS
A self-adversarial approach to delay analysis under arbitrary scheduling
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Approximation of generalized processor sharing with interleaved stratified timer wheels
IEEE/ACM Transactions on Networking (TON)
Scheduling scheme with fairness and adaptation in the joint allocation of heterogeneous resources
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
A distributed qos scheduler for smoothing output traffic of input buffered switches
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
| Hi-index | 0.00 |
In this paper, we present a novel fair queueing scheme, which we call Smoothed Round Robin (SRR). Ordinary round-robin schedulers are well known for the burstiness of their scheduling output. In order to overcome this problem, SRR codes the weights of the flows into binary vectors to form a Weight Matrix and then uses a Weight Spread Sequence (WSS), which is specially designed to distribute the output more evenly, to schedule packets by scanning a Weight Matrix. By using the WSS and the Weight Matrix, SRR emulates the Generalized Processor Sharing (GPS) well. SRR possesses better short-term fairness and scheduling delay properties in comparison with various existing round-robin schedulers. At the same time, SRR preserves O(1) time complexity by avoiding the time-stamp maintenance employed in various fair queueing schedulers. Simulation and implementation experiments show that SRR provides good mean end-to-end delay for soft real-time services. SRR can be implemented in high-speed networks to provide quality of service due to its simplicity and low time complexity.