Scheduling Algorithms for Different Approaches to Quality of Service Provisioning

IP network provides only best effort delivery meaning, that data is transmitted at unspecified variable bit rate and delivery time is unknown, depending on the current traffic load. Nowadays, real-time traffic occupies significant percentage of the available bandwidth and Internet must evolve to support new applications. Therefore one of the main and crucial objective of the future Internet is to change best effort network into Quality of Service controlled network.

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

[2]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[3]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[4]  Laxmi N. Bhuyan,et al.  Software techniques to improve virtualized I/O performance on multi-core systems , 2008, ANCS '08.

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

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

[7]  Youjian Zhao,et al.  HPFQ-M: Hierarchical Packet Fair Queuing Algorithm with Maximum Rate Control , 2008, PDPTA.

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

[9]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[10]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[11]  Congfeng Jiang,et al.  Analysis and Evaluation of the Scheduling Algorithms in Virtual Environment , 2009, 2009 International Conference on Embedded Software and Systems.

[12]  Alan L. Cox,et al.  Scheduling I/O in virtual machine monitors , 2008, VEE '08.

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

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

[15]  Alberto Leon-Garcia,et al.  Hierarchical fair queuing: single-step approximation of hierarchical-GPS , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[16]  Heung-Kyu Lee,et al.  A generalized hierarchical fair service curve algorithm for high network utilization and link-sharing , 2003, Comput. Networks.

[17]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[18]  Peter A. Dinda,et al.  VSched: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time Scheduling , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[19]  George C. Polyzos,et al.  SCED: A Generalized Scheduling Policy for Guarantee* Quality-of-Service , 1999 .

[20]  Heung-Kyu Lee,et al.  The service curve service discipline for the rate-controlled EDF service discipline in variable-sized packet networks , 2006, Comput. Commun..

[21]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services , 2000, TNET.

[22]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

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

[24]  Van Jacobson,et al.  An Expedited Forwarding PHB , 1999, RFC.