Improving utilization for deterministic service in multimedia communication

Network-based real-time multimedia applications require guaranteed performance communication services. To provide guaranteed service, resources have to be reserved within the network. If reservation is based on the peak rate of each connection, the network will be under-utilized by guaranteed service traffic when the traffic is bursty. We first show that local deterministic delay bounds can be guaranteed over a link for bursty traffic even when the sum of the peak rates of all the connections is greater than the link speed. Compared to previous admission control conditions, the new result allows a multi-fold increase in the number of admitted connections when the traffic is bursty. We then show that this new result can be efficiently extended from a single switch to a network of arbitrary topology by using rate-controlled service disciplines at the switches.<<ETX>>

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

[2]  Anindo Banerjea,et al.  Network support for multimedia: a discussion of the Tenet approach , 1994 .

[3]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

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

[6]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[7]  Domenico Ferrari,et al.  Real-Time Communication in an Internetwork , 1992, J. High Speed Networks.

[8]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[9]  Dinesh C Verma,et al.  Guaranteed Performance Communication in High Speed Networks , 1991 .

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

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

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

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

[14]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[15]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[16]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[17]  Edward W. Knightly,et al.  Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models , 1994, SIGMETRICS.

[18]  Anindo Banerjea,et al.  Queueing delays in rate controlled ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[19]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[20]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[21]  Amy R. Reibman,et al.  An adaptive congestion control scheme for real-time packet video transport , 1993, SIGCOMM 1993.

[22]  Hui Zhang,et al.  Graceful adaptation of guaranteed performance service connections , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[23]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.