Guaranteed versus controlled load: implications for service subscribers and providers in RSVP networks

The IETF Integrated Service Working Group has specified two service classes: guaranteed quality (GQ) service and controlled load (CL) service. What concerns service subscribers and providers most is the cost of these two services and their performance. For service subscribers, the question is which application deserves which service. For service providers, the question is how to charge their users reasonably to obtain the maximum revenue and what kinds of mechanisms can achieve better resource utilization. We try to answer the above questions under conservative and well-performed admission control schemes, respectively. Simulation results based on the common models of traffic, signaling protocol, policer, classifier, and packet scheduler are presented. When the traffic burstiness increases, the cost difference between GQ and CL increases significantly but the average performances do not have much difference. Thus, subscribers are suggested to use the CL service when the traffic burstiness is high and the delay bound is not critical, and vice versa. For providers, a well-performed admission control scheme is important, especially when the traffic burstiness is high, in limiting the cost difference between GQ and CL. It is observed that, with well-performed admission control, the cost difference can be reduced from 20 times to 1.41 times and 8 times to 1.14 times for bursty and less-bursty traffic, respectively.

[1]  David K. Y. Yau,et al.  An algorithm for lossless smoothing of MPEG video , 1994, SIGCOMM 1994.

[2]  A. Hac,et al.  Buffer control scheme in multimedia synchronization , 1997, 1997 IEEE International Performance, Computing and Communications Conference.

[3]  Ezhan Karasan,et al.  Client-Server Synchronization and Buffering for Variable Rate Multimedia Retrievals , 1996, IEEE J. Sel. Areas Commun..

[4]  Magda El Zarki,et al.  Bandwidth requirements of variable bit rate MPEG sources in ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[5]  Oliver Rose,et al.  Simple and Efficient Models for Variable Bit Rate MPEG Video Traffic , 1997, Perform. Evaluation.

[6]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[7]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

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

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

[10]  R. V. Cox,et al.  Three new speech coders from the ITU cover a range of applications , 1997, IEEE Commun. Mag..

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

[12]  Sandeep Agrawal,et al.  Window-based congestion control in a packet switched network with voice and data transmission , 1996, Comput. Commun..

[13]  Andrew Smith,et al.  Integrated Services over IEEE 802.1D/802.1p Networks , 1997 .

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

[15]  John Wroclawski,et al.  Specification of the Controlled-Load Network Element Service , 1997, RFC.

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

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

[18]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.