Conference proceeding
Fair, efficient and low-latency packet scheduling using nested deficit round robin
2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)
2001
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guarantees required by many applications. We present a new scheduling discipline called nested deficit round robin (Nested-DRR), which is fair, efficient and in addition has a low latency bound. Nested-DRR splits each DRR round into one or more smaller rounds, within each of which we run a modified version of the DRR scheduling discipline. In this paper, we analytically prove that Nested-DRR results in a significant improvement in the latency bound in comparison to DRR, and in addition preserves the good properties of DRR such as the per-packet work complexity of O(1). Nested DRR also has the same relative fairness bound as DRR.
Metrics
8 Record Views
Details
- Title
- Fair, efficient and low-latency packet scheduling using nested deficit round robin
- Creators
- S.S Kanhere - Drexel UniversityH Sethu - Drexel UniversityIEEE
- Publication Details
- 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)
- Conference
- 2001 IEEE Workshop on High Performance Switching and Routing
- Publisher
- IEEE
- Resource Type
- Conference proceeding
- Language
- English
- Web of Science ID
- WOS:000169433000002
- Other Identifier
- 991019312458204721
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, Hardware & Architecture
- Computer Science, Information Systems