Deficits for Bursty Latency-Critical Flows: DRR++

Authors:
Affiliations:
Venue:
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Year:
2000

Citing 0
Cited 4

OCGRR: A New Scheduling Algorithm for Differentiated Services Networks

IEEE Transactions on Parallel and Distributed Systems
LGRR: A new packet scheduling algorithm for differentiated services packet-switched networks

Computer Communications
Three new approaches for adjustment and improvement of the RR scheduler in a dynamic resource environment

Computer Communications
Weighted deficit earliest departure first scheduling

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair Queuing was invented to ensure that every flow gets its fair share of the total bandwidth. Efficient Fair Queuing Using Deficit Round-Robin, DRR, proposed by Shreedhar and Varghese [1], reduces the work to process each packet from O(log(n)) to O(1). DRR was also extended to accommodate latency-critical flows. DRR+ uses a timer to police each latency-critical flow, and was shown to have a latency bound of for these flows. The definition of the contract in [1], however, constrains a latency-critical flow to generate very smooth arrivals. By giving another definition of contract, we return to using the original concept of deficit to enforce each flow's commitment to its contract. This allows either for bursty arrivals, which may occur as the result of source bursts, or because of the dynamics of multihop network paths.