Scheduling scheme with fairness and adaptation in the joint allocation of heterogeneous resources

Authors:
Yu Hua;Chanle Wu;Mengxiao Wu
Affiliations:
School of Computer, Wuhan University, Wuhan, China;School of Computer, Wuhan University, Wuhan, China;Department of Computer Science, Vrije University, Amsterdam, Netherlands
Venue:
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Year:
2005

Citing 8
Cited 0

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

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

IEEE/ACM Transactions on Networking (TON)
Pre-order deficit round robin: a new scheduling algorithm for packet-switched networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair scheduling with tunable latency: a round-robin approach

IEEE/ACM Transactions on Networking (TON)
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

IEEE/ACM Transactions on Networking (TON)
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks

IEEE/ACM Transactions on Networking (TON)
On achieving fairness in the joint allocation of processing and bandwidth resources

IWQoS'03 Proceedings of the 11th international conference on Quality of service
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generally speaking, packets transmitted from source to destination need not only bandwidth and buffer but also computing and processing capacity in each node, available wavelength in optical networks and power in wireless sensor networks. So, joint and fair allocation of heterogeneous resources (such as, bandwidth, buffer and processing) is rather pivotal and necessary for realizing differentiated end-to-end QoS guarantee. In this paper, we proposed the framework and algorithm, realized fair allocation of heterogeneous resources, and designed the Heterogeneous-Deficit Round Robin (H-DRR) algorithm, which was the improvement to DRR. The comparison of performance with and without unfriendly packets stated that H-DRR could realize the fair allocation of heterogeneous resources and provide better QoS guarantee, especially in the differentiated situation.