Queueing delays in rate controlled ATM networks

The problem of finding the worst-case end-to-end delay and buffer occupancy bounds in asynchronous transfer mode (ATM) networks with rate-controlled, non-work-conserving servers is addressed. A theoretical framework is constructed to analyze such servers in isolation and in tandem. The analysis is based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy values are upper bounds on actual values. A single algorithm is presented to perform these calculations in linear time. Simulation results are given in order to compare the computed worst-case delays with the actual delays obtained on some simple network topologies. The algorithm is found to predict node delays well for bursty input traffic, but poorly for smooth input traffic. Buffer requirements are predicted well in both cases.<<ETX>>

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

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

[3]  Pravin Varaiya,et al.  A simple theory of traffic and resource allocation in ATM , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

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

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

[6]  Srinivasan Keshav,et al.  REAL: A Network Simulator , 1988 .

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

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

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

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

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

[12]  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.

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

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