10 October 1997 Cell loss and call-blocking performance for fluid-flow sources in buffered ATM networks
Author Affiliations +
Proceedings Volume 3231, Performance and Control of Network Systems; (1997); doi: 10.1117/12.290415
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
Design and analysis of ATM networks in which sources are represented as fluid on/off is addressed. It is critical that cell loss rate as an important QOS measure be related to the call blocking, an important network design parameter, and this relation be used in link capacity sizing, call admission, and routing design. Recently, some research on the relation of cell loss and call blocking have appeared. However, they ignore buffering in the multiplexer. In this paper, it is shown that call blocking in a buffered ATM multiplexer behaves as an Erlang-B loss system. For analytic purposes system buffer is assumed infinite and transmission rate of the link (C) is assumed to be finite. Using past results on probability of cell loss and properties of Nearly Completely Decomposable Markov Chains, the aggregate cell loss when system is in different states is determined. It is shown that call blocking performance for a given link capacity is independent of the individual source parameters. An extended set of application of the results and an inverse problem is stated.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kazem Sohraby, "Cell loss and call-blocking performance for fluid-flow sources in buffered ATM networks", Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); doi: 10.1117/12.290415; https://doi.org/10.1117/12.290415


Accelerating the deployment of VoIP and VoATM
Proceedings of SPIE (July 25 2001)
Technologies for convergence in the metro network
Proceedings of SPIE (February 08 2005)
Packet transport network in metro
Proceedings of SPIE (November 19 2008)
Deployment of private WDM networks
Proceedings of SPIE (December 01 1995)
The planning algorithms of ASTN architectures
Proceedings of SPIE (April 15 2004)

Back to Top