A Diffusion Cell Loss Estimate for ATM with Multiclass Bursty Traffic

  • Erol Gelenbe
  • Xiaowen Mang
  • Yutao Feng
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT)


We describe a diffusion approximation model for an ATM statistical multiplexer using the instantaneous return model approach (Gelenbe, 1975). Two Cell Loss Estimates are proposed for multiclass traffic. Our aim is to provide a novel conservative, accurate and computationally efficient method for predicting cell loss probabilities which we call the Finite Buffer Diffusion Cell Loss Estimate (FBDCLE) and Infinite Buffer Diffusion Cell Loss Estimate (IBDCLE). We evaluate their accuracy by comparing them with simulation results using a wide variety of input traffic characteristics. In particular we test the model with traffic which is a mixture of different “On-Off” sources with varying loads. Both homogeneous and heterogeneous aggregated arrival processes have been taken into account. These comparisons, which include evaluations of the statistical confidence of the simulation runs, show that our model predictions are very close to the simulation results. In particular, FBDCLE is a conservative upper bound to cell loss ratio, while the other (IBDCLE) provides an accurate predictor which may slightly under-estimate or over-estimate cell loss.


ATM network performance prediction quality of service queueing theory diffusion model call admission control bandwidth allocation. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. D. R. Cox and P. A. W. Lewis (1966). The Statistical Analysis of Series of Events. Methuen, London.zbMATHCrossRefGoogle Scholar
  2. A. Duda (1986). Diffusion approximations for time-dependent queueing systems. IEEE J. SAC, SAC–4(6), 905–18.Google Scholar
  3. E. Gelenbe (1975). On approximate computer system models. J. ACM, 22, 261–3.zbMATHCrossRefMathSciNetGoogle Scholar
  4. R. Guerin and L. Gun (1992). A unified approach to bandwidth allocation and access control in fast packet-switched networks. Proc. INFOCOM’92, 1–12.Google Scholar
  5. E. Gelenbe and G. Pujolle (1976) An approximation to the behaviour of a single queue in a network. Acta Informatica, 7, 123–36.zbMATHCrossRefMathSciNetGoogle Scholar
  6. H. Akimaru, T. Okuda and K. Nagai (1994) A Simplified Performance Evaluation for Bursty Multiclass Traffic in ATM Systems. IEEE Transactions on Communications, COM–42(5), 2078–83.CrossRefGoogle Scholar
  7. H. Heffes and D. M. Lucantoni (1986) A markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE J. SAC, SAC–4(6), 856–67.Google Scholar
  8. H. Kobayashi (1974) Application of the diffusion approximation to queueing networks: Parts I and II. J. ACM, 21, 316–28.zbMATHCrossRefGoogle Scholar
  9. H. Kobayashi and Q. Ren (1993) A diffusion approximation analysis of an ATM statistical multiplexer with multiple state solutions: Part I: Equilibrium state solutions. Proc. ICC’93, 1047–53.Google Scholar
  10. J. Medhi (1991) Stochastic Models in Queueing Theory. Academic Press, New York.zbMATHGoogle Scholar
  11. K. Sriram and W. Whitt (1986) Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE J. SAC, SAC–4 (6), 833–46.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 1996

Authors and Affiliations

  • Erol Gelenbe
    • 1
  • Xiaowen Mang
    • 2
  • Yutao Feng
    • 1
  1. 1.Department of Electrical and Computer EngineeringDuke UniversityDurhamUSA
  2. 2.Cascade Communications CorpWestfordUSA

Personalised recommendations