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

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hua, Y., Wu, C., & Wu, M. (2005). Scheduling scheme with fairness and adaptation in the joint allocation of heterogeneous resources. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3756 LNCS, pp. 151–163). Springer Verlag. https://doi.org/10.1007/11573937_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free