Hierarchical Deficit Round-Robin Packet Scheduling Algorithm

In the paper, we propose Hierarchical Deficit Round-Robin (HDRR) packet scheduling algorithm for multiple classes of service to pro-vide a fair share of residual bandwidth with lower computation complexity. We design HDRR based on the Deficit Round-Robin packet scheduling algorithm, and can distribute bandwidth in proportion to weights of flows sharing the bandwidth, and share the unused bandwidth to backlogged flows according to the hierarchical architecture. In order to realize the performance differences between the proposed scheduling algorithm and the other related scheduling algorithms, we implement the pro-posed scheduling algorithm in our simulation. The simulation results show that the proposed algorithm provides well QoS guarantees while fully utilizing the system bandwidth and low computation complexity.

[1]  Kihyun Pyun,et al.  A Hierarchical Deficit Round-Robin Scheduling Algorithm for a High Level of Fair Service , 2007, 2007 International Symposium on Information Technology Convergence (ISITC 2007).

[2]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[4]  M. Strzelecki,et al.  Automatic detection of pancreatic islets in magnetic resonanse rat liver images , 2008, New Trends in Audio and Video / Signal Processing Algorithms, Architectures, Arrangements, and Applications SPA 2008.

[5]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[6]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[7]  Michael S. Berger,et al.  Topology-based hierarchical scheduling using Deficit Round Robin: Flow protection and isolation for triple play service , 2009, 2009 First International Conference on Future Information Networks.

[8]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[9]  Chin-Chi Wu,et al.  Efficient and fair hierarchical packet scheduling using dynamic deficit round robin , 2005, Communications and Computer Networks.

[10]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[11]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1997, TNET.

[12]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[13]  George Varghese,et al.  A reliable and scalable striping protocol , 1996, SIGCOMM 1996.