A New Fair Queueing Algorithm with Dynamic Service Probability Adjustment

This letter proposes a new weighted fair queueing algorithm, which adjusts dynamically each flow's service probability according to its weight and average packet length and then uses the service probability parameters to implement fair queueing. This solves the main drawback of traditional weighted fair queueing algorithms — the packet-based tracing of weight parameters. In addition, this letter proposes a novel service probability calculation method which solves the unfairness problem induced by the variable packet length.

[1]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[3]  Choong Seon Hong,et al.  QoS-aware fair scheduling in multihop wireless ad hoc networks , 2006, 2006 8th International Conference Advanced Communication Technology.

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

[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.

[6]  T. Yoshida,et al.  Urgency-based round robin: a new scheduling discipline for packet switching networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[7]  Kang G. Shin,et al.  Adaptive-weighted packet scheduling for premium service , 2001, ICC.

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

[9]  Ruixue Fan,et al.  An improvement of weighted round robin cell scheduling in ATM networks , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[10]  Mani B. Srivastava,et al.  Energy efficient wireless packet scheduling and fair queuing , 2004, TECS.

[11]  Matthew Andrews,et al.  Probabilistic end-to-end delay bounds for earliest deadline first scheduling , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Yoshihiro Ito,et al.  Variably weighted round robin queueing for core IP routers , 2002, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326).