Loading...
Please wait, while we are loading the content...
Similar Documents
SRR: an O(1) time complexity packet scheduler for flows in multi-service packet networks (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Guo, Chuanxiong |
| Abstract | 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 (QoS) due to its simplicity and low time complexity. |
| File Format | |
| Volume Number | 1 |
| Journal | ACM SIGCOMM |
| Language | English |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Time Complexity Packet Scheduler Multi-service Packet Network Weight Matrix Scheduling Output Scheduling Delay Property Short-term Fairness Round Robin Scheduler Round Robin Generalized Processor Sharing Time-stamp Maintenance Weight Spread Sequence Binary Vector Low Time Complexity Soft Real-time Service Time Complexity Implementation Experiment High-speed Network Good Mean End-to-end Delay Ordinary Round Robin Scheduler |
| Content Type | Text |
| Resource Type | Article |
