Squeezing the most out of ATM

Citations Over TimeTop 1% of 1996 papers

Abstract

Although ATM seems to be the wave of the future, one analysis requires that the utilization of the network be quite low. That analysis is based on asymptotic decay rates of steady-state distributions used to develop a concept of effective bandwidths for connection admission control. The present authors have developed an exact numerical algorithm that shows that the effective-bandwidth approximation can overestimate the target small blocking probabilities by several orders of magnitude when there are many sources that are more bursty than Poisson. The bad news is that the appealing simple connection admission control algorithm using effective bandwidths based solely on tail-probability asymptotic decay rates may actually not be as effective as many have hoped. The good news is that the statistical multiplexing gain on ATM networks may actually be higher than some have feared. For one example, thought to be realistic, the analysis indicates that the network actually can support twice as many sources as predicted by the effective-bandwidth approximation. The authors also show that the effective bandwidth approximation is not always conservative. Specifically, for sources less bursty than Poisson, the asymptotic constant grows exponentially in the number of sources (when they are scaled as above) and the effective-bandwidth approximation can greatly underestimate the target blocking probabilities. Finally, they develop new approximations that work much better than the pure effective-bandwidth approximation.

Related Papers

• → Predictive control for efficient statistical multiplexing of digital video programs(2009)5 cited
• → A Note on Statistical Multiplexing and Scheduling in Video Networks at High Data Rates(2005)7 cited
• → Multiplexing gains in ATM networks(2000)2 cited
• → The poor gain from Statistical Multiplexing in the homogeneous and the heterogeneous case(1994)1 cited
• Digital multiplexing techniques(2011)