Skip to main content

A Performance Model for Statistical Multiplexing of correlated ATM Traffic Superpositions

  • Conference paper
Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen

Part of the book series: Informatik aktuell ((INFORMAT))

Abstract

Models for ATM statistical multiplexing must involve bursty (i.e. several cell arrivals are possible at a time instant) and correlated input processes. Correlation is important, since ATM networks will carry VBR video sources, the cell streams of which are typically correlated. In addition, the superposition of individual sources (e.g. in an ATM multiplexer), which are renewal (and non-Poisson), shows correlations. This paper extends recent results on queues with deterministic service times (greater or equal to the time-unit) and Semi-Markovian input processes (SMPs) to the SMP[x]/V/l/s queue. The SMP generates arrival instants, and the independent process X of i.i.d. random variables “modulates” the batch size. The solution provides the probability functions of the number of cells in the system and of the waiting time of a test-cell, the loss probability of a test-cell and the conditional cell loss probability. A possible extension allowing one batch input stream and one single cell stream is outlined; it can serve as a model for Connection Admission Control (CAC) in ATM.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Blondia and O. Casals. Statistical multiplexing of VBR sources: A matrix- analytic approach. Perf. EvaL, Vol. 16, No. 1–3, pp. 5–20, Nov. 1992.

    Article  MATH  Google Scholar 

  2. U. Briem, T.H. Theimer, H. Kroner. A General Discrete-Time Queueing Model: Analysis and Applications. In ITC-13, Vol. 14, Copenhagen, pp. 13–19, June 19–26 1991.

    Google Scholar 

  3. E. Cinlar. Introduction to Stochastic Processes. Prentice Hall, New Jersey, 1st edition, 1975.

    Google Scholar 

  4. W. Grassmann, M. Taksar, D. Heyman. Regenerative Analysis and Steady State Distributions for Markov Chains. Opns. Res., Vol. 33, No. 5, pp. 1107–1116, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  5. A. Gravey, J. Louvion and P. Boyer. On the Geo/D/1 and Geo/D/l/n Queues. Perf. Eval., Vol. 11, No. 2, pp. 117–125, July 1990.

    Article  Google Scholar 

  6. R. Griinenfelder J.P. Cosmas, S. Manthorpe, A. Odinma-Okafor. Characterization of Video Codecs as Autoregressive Moving Average Processes and Related Queueing System Performance. J. Sel. Areas Com, Vol. 9, No. 3, pp. 284–293, April 1991.

    Article  Google Scholar 

  7. C. Herrmann. Analysis of the Discrete-time SMP/D/l/s Finite Buffer Queue with Applications in ATM. In IEEE INFOCOM’93, San Francisco, March 28-April 1, 1993, Session 2a.3, pp. 160–167.

    Google Scholar 

  8. C. Herrmann. Correlation Effect on Per-stream QOS Parameters of ATM Traffic Superpositions relevant to Connection Admission Control. In IEEE ICC’93, Geneva, May 23-26, 1993f pp. 1027–1031.

    Google Scholar 

  9. J. J. Hunter. Mathematical Techniques of Applied Probability, Vol. 2, Discrete Time Models:techniques and Applications. Academic Press, New York, 1983.

    Google Scholar 

  10. M. Kramer. Computational Methods for Markov Chains occuringin Queueing Theory. In Messung, Modellierung und Bewertung von Rechnersystemen, Informatik Fachberichte 154, Springer, pp. 164–175, 1987.

    Google Scholar 

  11. D.M. Lucantoni, M.F. Neuts and K.S. Meier-Hellstern. A single server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Prob., Vol. 22, pp. 676–705, Sept. 1990.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. Murata, Y. Oie, T. Suda, H. Miyahara. Analysis of a Discrete-Time Single- Server Queue with Bursty Inputs for Traffic Control in ATM Networks. IEEE J- SAC, Vol. 8, No. 3, pp. 447–458, April 1990.

    Google Scholar 

  13. J.W. Roberts, editor. COST 224, Performance Evaluation and design of multiservice networks. Information technologies and sciences. France Telecom, 1991.

    Google Scholar 

  14. P. Tran-Gia, Hamid Ahmadi. Analysis of a discrete-time G x /D/l-S queueing system with applications in packet-switching systems. In IEEE INFOCOM’88, paper 9A.1.10, March 27–31, 1988.

    Google Scholar 

  15. W. Whitt. Approximating a point process by a renewal process, I.: two basic methods. Operations Research, Vol. 30, No. 1, pp. 125–147, 1982

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herrmann, C. (1993). A Performance Model for Statistical Multiplexing of correlated ATM Traffic Superpositions. In: Walke, B., Spaniol, O. (eds) Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78495-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78495-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57201-5

  • Online ISBN: 978-3-642-78495-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics