Tight Upper Bounds for Cell Loss Probabilities and Required Bandwidth Estimation in ATM Multiplexers
Author(s) -
Xiaoming Lru,
Liming Liu,
Bensaou Brahim,
Tsang Danny H. K.
Publication year - 1999
Publication title -
european transactions on telecommunications
Language(s) - English
Resource type - Journals
eISSN - 1541-8251
pISSN - 1124-318X
DOI - 10.1002/ett.4460100106
Subject(s) - multiplexer , bandwidth (computing) , asynchronous transfer mode , superposition principle , computer science , bandwidth allocation , upper and lower bounds , multiplexing , mathematical optimization , algorithm , computer network , mathematics , telecommunications , mathematical analysis
Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traffic control tasks such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on‐off sources. Based on this approximation, a simple algorithm is proposed to estimate accurately the aggregate required bandwidth to guarantee a given cell loss probability. Numerical results and comparisons to alternative approaches are also shown.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom