A survey on the chronological evolution of timestamp schedulers in packet switching networks

The interest in solving the issue of congestion or flow control in network established from the first discovery and increase popularity of the Internet in 1967 or earlier. As the use of the network deployed and the popularity increase, the issue grows and the demand for an optimal or tentative solution becomes obvious. Since that time there has been an intensive effort from the scholars and researchers to solve the congestion control problem. The problem get worse by the engagement of novel traffic with different characteristics for application called realtime applications such as video and voice applications. Another cause of this demand is the user himself. The attempt in solving the congestion problem in network layer was popular in 90's. This article will demonstrate chronologically how the attempts toward timestamp based scheduling in the packet-switch network have been evolved. Furthermore, the benefit and the drawbacks of using a mechanism will be presented. Also, a brief explanation of the mathematical, conceptual or implementation issue of a mechanism is given. The key success of the scheduler in the market will be highlighted. This paper will stimulate the research thinking to identify the importance and the ability of scheduling in routers to enhance quality of service (QoS) for real time application over other solution in several layers. In addition it will assist the researcher to distinguish the key failure of other proposed mechanisms which have not been implemented in real routers.

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

[2]  Andrea Francini,et al.  A weighted fair queueing scheduler with decoupled bandwidth and delay guarantees for the support of voice traffic , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[3]  Guojun Lu,et al.  Issues and technologies for supporting multimedia communications over the Internet , 2000, Comput. Commun..

[4]  James R. Davin,et al.  A simulation study of fair queueing and policy enforcement , 1990, CCRV.

[5]  Biswanath Mukherjee,et al.  Fair queueing with service envelopes (FQSE): a cousin-fair hierarchical scheduler for subscriber access networks , 2004, IEEE Journal on Selected Areas in Communications.

[6]  David Hogan,et al.  Hierarchical Fair Queueing , 1997 .

[7]  Meina Song,et al.  Implementing a high performance scheduling discipline WF2Q+ in FPGA , 2003, CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436).

[8]  NagleJohn.  Congestion control in IP/TCP internetworks , 1984 .

[9]  John B. Nagle,et al.  On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..

[10]  Dong-Yong Kwak,et al.  A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity , 2003 .

[11]  Hui Zhang,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[12]  Anujan Varma,et al.  Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks , 1997 .

[13]  Harish Sethu,et al.  Greedy fair queueing: a goal-oriented strategy for fair real-time packet scheduling , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[14]  Keping Long,et al.  SWFQ: a simple weighted fair queueing scheduling algorithm for high-speed packet switched network , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[15]  Dong-Yong Kwak,et al.  Mean starting potential fair queuing for high-speed packet networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[16]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[17]  Harrick M. Vin,et al.  Packet scheduling algorithms for integrated services networks , 1997 .

[18]  C. R. Bennett,et al.  Why WFQ Is Not Good Enough For Integrated Services , 2007 .

[19]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[20]  Harrick M. Vin,et al.  Fair airport scheduling algorithms , 1997, Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97).

[21]  Stefano Giordano,et al.  Analysis and simulation of WF2Q+ based schedulers: comparisons, compliance with theoretical bounds and influence on end-to-end delay jitter , 2001, Comput. Networks.

[22]  Naehyuck Chang,et al.  A new queue discipline for various delay and jitter requirements in real-time packet-switched networks , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[23]  S. Jamaloddin Golestani,et al.  Congestion-free communication in high-speed packet networks , 1991, IEEE Trans. Commun..

[24]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[25]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[26]  Paolo Valente.  Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler , 2004, SIGCOMM '04.

[27]  Domenico Ferrari.  Client requirements for real-time communication services , 1990 .

[28]  Andrea Francini,et al.  Minimum-delay self-clocked fair queueing algorithm for packet-switched networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[29]  Jin Xiao.  Two simple implementation algorithms of WFQ and their performance analysis , 2002 .

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

[31]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[32]  Jörg Liebeherr,et al.  A near-optimal packet scheduler for QoS networks , 1997, Proceedings of INFOCOM '97.

[33]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[34]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[35]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[36]  S. Jamaloddin Golestani.  Congestion-free transmission of real-time traffic in packet networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[37]  H. Saidi,et al.  FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks , 2008, 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications.

[38]  David Hogan.  Hierarchical Fair Queuing Technical Report Number 506 May , 1996 , 2003 .

[39]  Meng Chang Chen,et al.  WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control , 2007, Comput. Networks.

[40]  Liu Ju,et al.  A novel hierarchical packet fair scheduling model , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

[41]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, PODC '97.

[42]  Zsehong Tsai,et al.  Enhancing the fairness of TCP over Internet using an improved hierarchical packet fair queueing scheme , 2000, Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium.

[43]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time and priority services , 1997, SIGCOMM '97.

[44]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[45]  John Nagle,et al.  Congestion control in IP/TCP internetworks , 1995, CCRV.

[46]  Seyyed Jamaaloddin Golestaani,et al.  A unified theory of flow control and routing in data communication networks , 1980 .

[47]  Harish Sethu,et al.  An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[48]  S. J. Golestani.  A stop-and-go queueing framework for congestion management , 1990, SIGCOMM 1990.

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

[50]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[51]  S. Jamaloddin Golestani.  Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

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

[53]  Douglas Comer,et al.  Design and Analysis of Hybrid Packet Schedulers , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[54]  Stefano Giordano,et al.  Analysis and Simulation of WF2Q+ Based Schedulers: Comparisons and Compliance with Theoretical Bounds , 2001, QoS-IP.

[55]  Xiao-ming Zhang,et al.  An Efficient Policy-based Packet Scheduler With Flow Cache , 2007, 2007 Workshop on High Performance Switching and Routing.

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

[57]  Anujan Varma,et al.  Efficient fair queueing algorithms for packet-switched networks , 1998, TNET.