Quality-of-Service in Packet Networks: Basic Mechanisms and Directions

In this paper, we review the basic mechanisms used in packet networks to support Quality-of-Service QoS guarantees. We outline the various approaches that have been proposed, and discuss some of the trade-offs they involve. Specifically, the paper starts by introducing the different scheduling and buffer management mechanisms that can be used to provide service differentiation in packet networks. The aim is not to provide an exhaustive review of existing mechanisms, but instead to give the reader a perspective on the range of options available and the associated trade-off between performance, functionality, and complexity. This is then followed by a discussion on the use of such mechanisms to provide specific end-to-end performance guarantees. The emphasis of this second part is on the need for adapting mechanisms to the different environments where they are to be deployed. In particular, fine grain buffer management and scheduling mechanisms may be neither necessary nor cost effective in high speed backbones, where ''aggregate'' solutions are more appropriate. The paper discusses issues and possible approaches to allow coexistence of different mechanisms in delivering end-to-end guarantees. q 1999 Elsevier Science B.V. All rights reserved.

[1]  Juha Heinanen Use of the IPv4 TOS Octet to Support Differential Services , 1997 .

[2]  S. Jamaloddin Golestani,et al.  Network Delay Analysis of a Class of Fair Queueing Algorithms , 1995, IEEE J. Sel. Areas Commun..

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

[4]  Leonidas Georgiadis,et al.  Efficient support of delay and rate guarantees in an internet , 1996, SIGCOMM 1996.

[5]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

[6]  Roch Guérin,et al.  Efficient Support of Delay and Rate Guarantees in an Internet , 1996, SIGCOMM.

[7]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

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

[9]  Roch Guerin,et al.  Aggregating RSVP-based QoS Requests , 1997 .

[10]  Anujan Varma,et al.  Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks , 1996, SIGMETRICS '96.

[11]  Roch Guérin,et al.  On protective buffer policies , 1994, TNET.

[12]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[13]  Levent Gun An approximation method for capturing complex traffic behavior in high speed networks , 1994 .

[14]  NetworksAllyn Romanow,et al.  Dynamics of Tcp Traac over Atm Networks , 1994 .

[15]  Kalevi Kilkki Simple Integrated Media Access (SIMA) , 1997 .

[16]  Donald F. Towsley,et al.  Efficient admission control for EDF schedulers , 1997, Proceedings of INFOCOM '97.

[17]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[18]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[19]  Mark W. Garrett,et al.  Interoperation of Controlled-Load Service and Guaranteed Service with ATM , 1998, RFC.

[20]  Scott Shenker,et al.  General Characterization Parameters for Integrated Service Network Elements , 1997, RFC.

[21]  G. Varghese Eecient Fair Queuing Using Deecit round Robin , 1995 .

[22]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[23]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[24]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[25]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[26]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[28]  Anujan Varma,et al.  FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS , 1995 .

[29]  David Clark,et al.  An Approach to Service Allocation in the Internet , 1997 .

[30]  Hans Kröner,et al.  Priority Management in ATM Switching Nodes , 1991, IEEE J. Sel. Areas Commun..

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

[32]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated service packet networks , 1997, TNET.

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

[34]  Rene L. Cruz,et al.  Service Burstiness and Dynamic Burstiness Measures: A Framework , 1992, J. High Speed Networks.

[35]  Levent Gün An Approximation Method for Capturing Complex Traffic Behavior in High Speed Networks , 1994, Perform. Evaluation.

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

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

[38]  George C. Polyzos,et al.  A service-curve approach to performance guarantees in integrated-service networks , 1996 .

[39]  Ed Ellesson,et al.  A Proposal for the Format and Semantics of the TOS Byte and Traffic Class Byte in IPv4 and IPv6 Headers , 1997 .

[40]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

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

[42]  D. Clark Adding service discrimination to the Internet , 1996 .

[43]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[44]  Vinod Peris,et al.  Architecture for Guaranteed Delay Service in High Speed Networks , 1998 .

[45]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[46]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.

[47]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

[48]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.

[49]  Roch Guérin,et al.  Bandwidth Management and Congestion Control Framework of the Broadband Betwork Architecture , 1993, Comput. Networks ISDN Syst..

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

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

[52]  Roch Guérin,et al.  Cell versus message level performances in ATM networks , 1996, Telecommun. Syst..

[53]  Richard J. Gibbens,et al.  Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..

[54]  S. Berson,et al.  Aggregation of Internet Integrated Services state , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[55]  J. Le Boudec,et al.  Scalable resource reservation for the Internet , 1997, Proceedings of International Conference on Protocols for Multimedia Systems - Multimedia Networking.

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

[57]  Jonathan S. Turner Maintaining high throughput during overload in ATM switches , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[58]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[59]  Farouk Kamoun,et al.  Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions , 1980, IEEE Trans. Commun..

[60]  K. Sivarajan Eecient Network Qos Provisioning Based on per Node Traac Shaping , 1996 .

[61]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[62]  Paul Ferguson,et al.  Simple Differential Services: IP TOS and Precedence, Delay Indication, and Drop Preference , 1998 .

[63]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[64]  Hamid Ahmadi,et al.  NBBS Traffic Management Overview , 1995, IBM Syst. J..

[65]  David Tse,et al.  A framework for robust measurement-based admission control , 1999, TNET.

[66]  Roch Guérin,et al.  Scalable QoS provision through buffer management , 1998, SIGCOMM '98.