Telecommunication Systems

, Volume 2, Issue 1, pp 1–20 | Cite as

A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals

  • S. Hong
  • H. G. Perros
  • H. Yamashita


We model the shared buffer ATM switch as a discrete-time queueing system. The arrival process to each port of the ATM switch is assumed to be bursty and it is modelled by an interrupted Bernoulli process. The discrete-time queueing system is analyzed approximately. It is first decomposed into subsystems, and then each subsystem is analyzed separately. The results from the subsystems are combined together through an iterative scheme. The analysis of each subsystem involves the construction of the superposition of all the arrival processes to the switch. Comparisons with simulation data showed that the approximate results have a good accuracy.


Information System Artificial Intelligence Communication Network Stochastic Process Probability Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S.L. Albin, Approximating a point process by a renewal process, 2: Superposition arrival processes to queues, Oper. Res. 32(1984)1133–1162.Google Scholar
  2. [2]
    A. Baiocchi, N. Melazzi, M. Listanti, A. Roveri and R. Winkler, Loss performance analysis of an ATM multiplexer loaded with high-speed on-off sources, IEEE J. SAC 9(1991)388–393.Google Scholar
  3. [3]
    P. Boyer, M.R. Lehnert and P.J. Kuehn, Queueing in an ATM basic switch element, Technical Report CNET-123-030-CD-CC, CNET, France (1988).Google Scholar
  4. [4]
    H. Bruneel and B. Steyaert, Tail distribution of shared buffer queue contents, Technical Report, RUG Internal Research Report No. 4, 900522.Google Scholar
  5. [5]
    M. Devault, J.-Y. Cochennec and M. Servel, The “Prelude” ATD experiment: Assessments and future prospects, IEEE J. SAC 6(1988)1528–1537.Google Scholar
  6. [6]
    A.E. Eckberg and T.-C. Hou, Effects of output buffer sharing on buffer requirements in an ATDM packet switch,INFOCOM'88 (1988) pp. 459–466.Google Scholar
  7. [7]
    H. Heffes, A class of data traffic processes-covariance function characterization and related queueing results, Bell. Sys. Tech. J. 59(1980)897–929.Google Scholar
  8. [8]
    H. Heffes and D.M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE J. SAC 4(1986)856–868.Google Scholar
  9. [9]
    I. Iscoe, D. McDonald and K. Qian, Capacity of ATM switch, Technical Report, Department of Mathematics, University of Ottawa.Google Scholar
  10. [10]
    F.P. Kelly,Reversibility and Stochastic Networks (Wiley, New York, 1979).Google Scholar
  11. [11]
    D.D. Kouvatsos and N.P. Xenios, MEM for arbitrary queueing networks with multiple general services and repetitive-service blockings, Perform. Eval. 10(1989)169–195.CrossRefGoogle Scholar
  12. [12]
    H. Kuwahara, N. Endo, M. Ogino and T. Kozaki, A shared buffer memory switch for an ATM exchange,Int. Conf. on Communications, Boston, MA (1989) pp. 4.4.1–4.4.5.Google Scholar
  13. [13]
    H. Lee, K. Kook, C.S. Rim, K. Jun and S.-K. Lim, A limited shared output buffer switch for ATM,4th Int. Conf. on Data Communication Systems and Their Performance, Barcelona (1990) pp. 163–179.Google Scholar
  14. [14]
    R. Nagarajan, J.F. Kurose and D. Towsley, Approximation techniques for computing packet loss in finite-buffered voice multiplexers, IEEE J. SAC 9(1991)368–377.Google Scholar
  15. [15]
    I. Norros, J.W. Roberts, A. Simmonian and J.T. Virtamo, Loss performance analysis of an ATM multiplexer loaded with high-speed on-off sources, IEEE J. SAC 9(1991)378–387.Google Scholar
  16. [16]
    H.G. Perros and R. Onvural, On the superposition of arrival processes for voice and data,4th Int. Conf. on Data Communication Systems and Their Performance, Barcelona (1990) pp. 341–357.Google Scholar
  17. [17]
    G.H. Petit, A. Buchheister, A. Guerrero and P. Parmentier, Performance evaluation methods applicable to an ATM multi-path self-routing switching network, in:Teletraffic and Datatraffic in a Period of Change, ed. Jensen and Iversen (North-Holland, Amsterdam, 1991) pp. 917–922.Google Scholar
  18. [18]
    G.H. Petit and E.M. Desmet, Performance evaluation of shared buffer multiserver output queue switches used in ATM,7th TTC Specialist Seminar, New Jersey (1990) paper 7.1.Google Scholar
  19. [19]
    G. Pujolle and H.G. Perros, Queueing systems for modelling ATM networks,Performance of Distributed Systems and Integrated Commun. Networks (North-Holland, Amsterdam, 1992) pp. 301–321.Google Scholar
  20. [20]
    B. Sengupta, A queue with superposition of arrival streams with and application to packet voice technology,Performance'90, ed. King, Mitrani and Pooley (North-Holland, Amsterdam, 1990) pp. 53–59.Google Scholar
  21. [21]
    K. Sriram and W. Whitt, Characterizing superposition arrival processes in packet multiplexers for voice and data, IEEE J. SAC 4(1986)833–846.Google Scholar
  22. [22]
    F.A. Tobagi, Fast packet switch architectures for broadband integrated services networks, Proc. IEEE 78(1990)1133–1167.CrossRefGoogle Scholar
  23. [23]
    W. Whitt, Approximating a point process by a renewal process, 1: Two basic methods, Oper. Res. 30(1982)125–147.Google Scholar
  24. [24]
    H. Yamashita, H.G. Perros and S. Hong, Performance modelling of a shared buffer ATM switch architecture,Teletraffic and Datatraffic in a Period of Change, ed. Jensen and Iversen (North-Holland, Amsterdam, 1991) pp. 993–998.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1993

Authors and Affiliations

  • S. Hong
    • 1
  • H. G. Perros
    • 1
  • H. Yamashita
    • 2
  1. 1.Computer Science Department and Center for Communication and Signal ProcessingNorth Carolina State UniversityRaleighUSA
  2. 2.Mechanical Engineering DepartmentSophia UniversityTokyoJapan

Personalised recommendations