Fair and Efficient Packet Scheduling Using Resilient Quantum Round-Robin

Round-robin based packet scheduling algorithms are suitable for high-speed networks, but in a variable-length packet environment, this kind of scheduling algorithm need consider packet length to guarantee scheduling fairness. Previous schemes are not perfect for fairness and efficiency. This paper presents a new easily implementable scheduling discipline, called Resilient Quantum Round-Robin (RQRR), in which the quantum given to each of the flows in a round is not fixed and is calculated depending on the transmission situation of all the flows in the previous round. We prove that the implementation complexity of RQRR is O (1) with respect to the number of flows. We analytically prove the fairness properties of RQRR, and show that its relative fairness measure has an upper bound of 7Max-1, where Max is the size of the largest packets. Finally, we present simulation results comparing the fairness and performance characteristics of RQRR with deficit round-robin (DRR), which show that RQRR achieves better short time scale fairness and scheduling delay properties.

[1]  Xue Liu,et al.  Scheduling Heterogeneous Flows with Delay-Aware Deduplication for Avionics Applications , 2012, IEEE Transactions on Parallel and Distributed Systems.

[2]  Salil S. Kanhere,et al.  Fair, efficient and low-latency packet scheduling using nested deficit round robin , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[3]  A. V. Ramprasad,et al.  Analysis of FiWi networks to improve TCP Performance , 2012, 2012 International Conference on Computing, Communication and Applications.

[4]  Ellen W. Zegura,et al.  Deficit Round-Robin Based Message Ferry Routing , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

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

[8]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

[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]  Dhananjay Kumar,et al.  Adaptive packet scheduling algorithm for real-time services in Wi-MAX networks , 2011, 2011 International Conference on Recent Trends in Information Technology (ICRTIT).

[12]  Li Hui.  Research on input-queued slicing domain scheduling based on Crossbar in the reconfigurable network , 2012 .

[13]  Reinhard German,et al.  Analysis of deficit round robin scheduling for future aeronautical data link , 2011, 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications.

[14]  Mohamed S. Abo-El-Seoud,et al.  Two layer channel aware scheduling for QoS support in IEEE 802.16/WiMAX networks , 2011, 2011 Eighth International Conference on Wireless and Optical Communications Networks.

[15]  Upamanyu Madhow,et al.  Fair scheduling with tunable latency: a round robin approach , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).