Conference proceeding
On the latency bound of deficit round robin
Proceedings. Eleventh International Conference on Computer Communications and Networks, v 2002-, pp 548-553
2002
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
The emerging high-speed broadband packet-switched networks are expected to simultaneously support a variety of services with different quality-of-service (QoS) requirements over the same physical infrastructure. Fair packet scheduling algorithms used in switches and routers play a critical role in providing these QoS guarantees. Deficit round robin (DRR), a popular fair scheduling discipline, is very efficient with an O(l) dequeuing complexity. Using the concept of latency-rate (/spl Lscr//spl Rscr/) servers introduced by Stiliadis and Varma (1996), we obtain an upper bound on the latency of DRR and prove that our bound is tight. Our upper bound is lower than the previously known upper bound. This illustrates that the DRR scheduler has better performance characteristics than previously believed, especially for real-time applications where the latency plays a role in the size of the playback buffer required.
Metrics
Details
- Title
- On the latency bound of deficit round robin
- Creators
- S.S Kanhere - Drexel UniversityH Sethu - Drexel University
- Publication Details
- Proceedings. Eleventh International Conference on Computer Communications and Networks, v 2002-, pp 548-553
- Publisher
- IEEE
- Resource Type
- Conference proceeding
- Language
- English
- Web of Science ID
- WOS:000179483500083
- Scopus ID
- 2-s2.0-84948677939
- Other Identifier
- 991019312456104721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Information Systems
- Telecommunications