Traffic Control in ATM: A Review, an Engineer’s Critical View & a Novel Approach

  • Nikolas M. Mitrou
Part of the The International Series in Engineering and Computer Science book series (SECS, volume 557)


This paper has a twofold objective. First, it aims at reviewing the basic ATM traffic control functions, as defined by the standards, addressing popular methods that are used for performance analysis of ATM multiplexing and, then, bending critically over controversial issues in this area; among these issues is the suitability of statistical models for traffic control, the effectiveness of rate-based control schemes as well as the advantages and disadvantages of using effective rates as traffic descriptors. Motivated by the results of this critical analysis, the second part of the paper is devoted to a new approach to the ATM traffic control problem. Taking into account the foreseen convergence between IP and ATM, it focuses on a burst-level modelling through the classical M/G/1 model, which essentially ignores cell-level details within bursts, including the cell rate itself, and exploits the buffering gain, assuming a large buffer_space/burst_size ratio.


ATM Traffic Control Statistical Gain Effective Rate M/G/1 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Anick D., Mitra D. and Sondhi M.M., (1982) “Stochastic theory of a data-handling system with multiple sources”, Bell Syst. Tech. J. 61, 1871–1894.MathSciNetGoogle Scholar
  2. [2]
    ATM Forum (1996), “Traffic Management Specification,” Ver. 4.0, April 1996.Google Scholar
  3. [3]
    ATM Forum (1998), BTD-TM-01.03, Traffic Management Working Group Baseline Text Document. John Kenney, ed. October, 1998.Google Scholar
  4. [4]
    Bolotin V., Kappel J and Kuehn P. (1991) eds, Special Issue on:Teletraffic Analysis of Communications Systems,” IEEE Journal on Sel. Areas in Commun., Vol. 9, No. 2, 4.Google Scholar
  5. [5]
    Burgin J. and Dorman D. (1991), “B-ISDN Resource Management: The Role of Virtual Paths”, IEEE Comm. Mag., Vol. 29, No. 9, pp. 44–48.Google Scholar
  6. [6]
    Chang C.-S. and Thomas J.A. (1995), “Effective bandwidth in high-speed digital networks,” IEEE JSAC, Vol. 13, No. 6, pp.1091–1100.Google Scholar
  7. [7]
    Cox D.R. (1962), Renewal Theory, Methuen & Co, London.Google Scholar
  8. [8]
    Elwalid A.I., Mitra D. and Stern T.E. (1991), “Statistical Multiplexing of Markov Modulated Sources: Theory and Computational Algorithms”, ITC’ 91, Copengagen.Google Scholar
  9. [9]
    Elwalid A. and Mitra D. (1993), “Effective bandwidth of general Markovian sources and admission control of high speed networks,” IEEE/ACM Trans. on Net., pp. 329–343.Google Scholar
  10. [10]
    Gibbens R.J. and Hunt P.J. (1991), “Effective bandwidths for the multi-type UAS channel,” Queueing Sys., 9, pp. 17–28.Google Scholar
  11. [11]
    Guerin R., Ahmadi H. and Naghshineh M. (1991), “Equivalent capacity and its application to bandwidth allocation in high-speed networks,” IEEE JSAC, 9, pp. 968–981.Google Scholar
  12. [12]
    Hsu I. and Warland J. (1996), “Admission control for multi-class ATM traffic with overflow constraints,” Comp. Net. and ISDN Sys., Vol. 28, pp. 1739–1751.Google Scholar
  13. [13]
    ITU-T (1996), Recommendation 1.371, “Traffic control and congestion control in B-ISDN”, ITU-T Study Group 13, Geneva, April 1996.Google Scholar
  14. [14]
    Jain R. (1996), “Congestion control and traffic management in ATM networks: Recent advances and a survey,” Comp. Net. And ISDN Sys., Vol. 28, pp. 1723–1738.Google Scholar
  15. [15]
    Kelly F.P. (1991), “Effective bandwidths at multi-type queues,” Queueing Syst., vol. 9, pp. 5–15.CrossRefzbMATHGoogle Scholar
  16. [16]
    Kesidis G., Warland J. and Chang C.-S. (1993), “Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources”, IEEE/ACM Trans. on Networking, Vol. 1, No 4, pp. 424–428.CrossRefGoogle Scholar
  17. [17]
    Kingman J. (1970), “Inequalities in the theory of queues,” J. Roy. Statist. Soc., Ser. B, Vol. 32, pp. 102–110.zbMATHMathSciNetGoogle Scholar
  18. [18]
    Kleinrock L. (1975), Queueing Systems, vol. II, ch. 2, New York, John Wiley.Google Scholar
  19. [19]
    Kontovasilis K.P. and Mitrou N.M. (1994), “Bursty Traffic Modelling and Efficient Analysis Algorithms via Fluid-Flow Models for ATM IBCN,” Annals of Operations Research, Vol. 49, spec, issue on Methodologies for High Speed Networks, pp. 279–323.CrossRefGoogle Scholar
  20. [20]
    Kontovasilis K.P. and Mitrou N.M. (1995), “Markov Modulated Traffic with Near Complete Decomposability Characteristics and Associated Fluid Queueing Models,” Applied Probability Journal Vol. 27, No. 4, Dec. 1995, pp. 1144–1185.MathSciNetGoogle Scholar
  21. [21]
    Kontovasilis K.P. and Mitrou N.M. (1997), “Effective Bandwidths for a Class of Non Markovian Fluid Sources”, ACM SIGCOMM’97 Conf, 14–18 Sept. 1997, Cannes France.Google Scholar
  22. [22]
    Kosten L. (1984), “Stochastic theory of data-handling systems with groups of multiple sources,” in Performance of Computer Communication Systems, H. Rudin and W. Bux, Eds. Amsterdam, The Netherlands: Elsevier, pp. 321–331.Google Scholar
  23. [23]
    Kroner H., Hebutern G., Boyer P. and Gravey A. (1991), “Priority Management in ATM Switching Nodes,” IEEE J-SAC, Vol. 9, No.3, pp. 418–427.Google Scholar
  24. [24]
    Kuehn P., Lehnert R. and Gallassi G. (1994), eds, Special Issue on “Teletraffic Research for Broadband-ISDN in the Race Programme”, European Transactions on Telecommunications, Vol. 5, No. 2.Google Scholar
  25. [25]
    Mace S. (1997), “ATM’s Shrinking Role”, Byte, Oct. 1997, pp. 59–62.Google Scholar
  26. [26]
    Mitrou N.M., Vamvakos S., Kontovasilis K. (1995), “Modelling, Parameter Assessment and Multiplexing Analysis of Bursty Sources with Hyper-exponentially Distributed Bursts Computer Networks and ISDN Systems, Vol. 27, pp. 1175–1192.CrossRefGoogle Scholar
  27. [27]
    Mitrou N.M., Kontovasilis K. and Nellas V. (1994), “Bursty Traffic Modelling and Multiplexing Performance Analysis in ATM Networks: A Three-moment Approach,” 2nd IFIP Intern. Workshop on on Performance Modelling and Evaluation of ATM Networks, Bradford, 4–6 June 1994.Google Scholar
  28. [28]
    Mitrou N..M., Kontovasilis K.P., Kroener H. amd Iversen V.B. (1994), “Statistical Multiplexing, Bandwidth Allocation Strategies and Connection Admission Control in ATM Networks,” European Trans. on Telecommunications, Vol. 5, No. 2, pp. 161–175.Google Scholar
  29. [29]
    Mitrou N.M., Kontovasilis K. and Protonotarios E.N. (1995), “A closed-form expression for the effective rate of On/Off traffic streams and its usage in basic ATM traffic control problems,” Proc. Int. Teletrqffic Seminar, St. Petersburg, pp. 423–430.Google Scholar
  30. [30]
    Mitrou N.M., Lykouropoulos N., Nellas V. and Kontovasilis K. (1996), “Experimental Validation of Selected Results on ATM Statistical Multiplexing in the EXPLOIT Project,” European Trans. on Telecommunications, Vol. 7, No. 5, pp. 423–431.Google Scholar
  31. [31]
    Mitrou N.M. and Kontovasilis K. (1996), “Comparison of Three Control Laws for Statistical Multiplexing in ATM,” Journal on Communications, Vol. XLVIII, Jan.–Feb. 1996, pp. 24–29.Google Scholar
  32. [32]
    Mitrou N.M. and Kavidopoulos K. (1998), “Traffic Engineering using a class of M/G/1 models,” J. of Net. & Comp. Appl. Vol. 21, pp. 239–271.Google Scholar
  33. [33]
    Mitrou N.M. (1999), “Shaping of Traffic Streams through Data Spacing”, IEEE Communications Letters, Vol. 3, No. 10.Google Scholar
  34. [34]
    Neuts M. (1979), “A Versatile Markovian Point Process,” J. Appl. Prob., 16, 764–779.zbMATHMathSciNetGoogle Scholar
  35. [35]
    Ramaswami V. (1980), “The N/G/1 Queue and its Detailed Analysis,” Adv. Appl. Prob. Vol. 12, pp. 222–261.zbMATHMathSciNetGoogle Scholar
  36. [36]
    Stern T.E. and Elwalid A.I. (1991), “Analysis of separable Markov-modulated rate models for information-handling systems”, Advances in Applied Probability, vol. 23, pp. 105–139.MathSciNetGoogle Scholar
  37. [37]
    Turner J. (1986), “Design of an Integrated Services Packet Network,” IEEE Journal on Select. Areas in Commun., Vol. 4, No 8, pp. 1373–1380.Google Scholar
  38. [38]
    De Veciana C., Kesidis G. and Warland J. (1995), “Resource management in wide-area ATM networks using effective bandwidths,” IEEE JSAC, Vol. 13, No. 6, pp. 1081–1090.Google Scholar
  39. [39]
    Xiong Y., Bruneel H. and Petit G. (1993), “Performance study of an ATM self-routing multistage switch with bursty traffic: simulation and analytic approximation”, Europ. Trans. on Telecomm. (ETT), vol. 4, no. 4, July–August 1993, pp. 443–453.Google Scholar
  40. [40]
    Yang C.-Q. and Reddy A.V.S. (1995), “A taxonomy for Congestion Control Algorithms in Packet Switching Networks,” IEEE Network, July/August 1995, pp. 34–45.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Nikolas M. Mitrou
    • 1
  1. 1.Heroon Polytechneiou 9National Technical University of AthensZografouGreece

Personalised recommendations