Weighted deficit earliest departure first scheduling

Authors:
Teck Meng Lim;Bu Sung Lee;Chai Kiat Yeo
Affiliations:
Centre of Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Nanyang, Singapore;Centre of Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Nanyang, Singapore;Centre of Multimedia and Network Technology, School of Computer Engineering, Nanyang Technological University, Nanyang, Singapore
Venue:
Computer Communications
Year:
2005

Citing 10
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

IEEE/ACM Transactions on Networking (TON)
Deficits for Bursty Latency-Critical Flows: DRR++

ICON '00 Proceedings of the 8th IEEE International Conference on Networks
LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS

LATENCY-RATE SERVERS: A GENERAL MODEL FOR ANALYSIS OF TRAFFIC SCHEDULING ALGORITHMS
Multiprogramming for hybrid computation

AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
New directions in communications (or which way to the information age?)

IEEE Communications Magazine - Part Anniversary
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip

IEEE Journal on Selected Areas in Communications

A new scalable service discipline for real-time traffic: The framed-deadline scheduler

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Deficit Round Robin (DRR) and Weighted Deficit Round Robin schedulers have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to provide fairness in terms of waiting time of packets among flows. We propose a new packet scheduling discipline, Weighted Deficit Earliest Departure First scheduler. It provides fairness in terms of throughput and differentiation in average and worst-case queuing time among queues that require different rate and delay guarantees. Simulation shows that it achieves near-perfect throughput fairness that is comparable to DRR scheduler and delay differentiation that is comparable to Earliest Departure First scheduler.