A Comparative Performance Analysis of Call Admission Control Schemes in ATM Networks

  • Khaled Elsayed
  • Harry Perros
Part of the The International Series in Engineering and Computer Science book series (SECS, volume 557)


Connection Admission Control (CAC) is one of the primary mechanisms for preventive congestion control and bandwidth allocation in ATM networks. A substantial number of CAC schemes have been proposed. In this paper, we review the salient features of some of these algorithms. We also provide a comparative study of the performance of CAC schemes devised to meet certain quality of service requirements expressed in terms of cell loss probability and maximum delay.


Call Admission Control Traffic Management ATM Networks Quality of Service Effective Bandwidth Diffusion Approximation PGPS EDF SP 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [2]
    P. Castelli, E. Cavallero, and A. Tonietti, Policing And Call Admission Problems in ATM Networks, in: A. Jensen and V.B. Iversen (Eds.), Teletraffic and datatraffic in a period of change, (North-Holland, 847–852, 1991.Google Scholar
  2. [3]
    C.-S. Chang and J. A. Thomas. Effective Bandwidth in High Speed Networks. IEEE Journal on Selected Areas in Communications, 13:1091–1100, 1995.Google Scholar
  3. [4]
    G. L. Choudhury, D. M. Lucantoni, and W. Whitt, On the Effective Bandwidths for Admission Control in ATM Networks. In Proceedings of 14th International Teletraffic Congress (ITC), pages 411–420, 1994.Google Scholar
  4. [5]
    R. Cruz, A calculus for network delay: part I: Network elements in isolation, IEEE Trans. Inform. Theory, vol. 37, 114–131, 1991.zbMATHMathSciNetGoogle Scholar
  5. [6]
    B. T. Doshi. Deterministic Rule Based Traffic Descriptors for Broadband ISDN: Worst Case Behavior and Connection Acceptance Control. In Proceedings of 14th International Teletraffic Congress (ITC), 591–600, 1994.Google Scholar
  6. [7]
    N. G. Duffield, J. T. Lewis, N. O’Connel, R. Russell, and F. Toomey. Entropy of ATM Traffic Streams: A Tool for Estimating QoS Parameters. IEEE Journal on Selected Areas in Communications, 13:981–990, 1995.CrossRefGoogle Scholar
  7. [8]
    K. Elsayed and H. G. Perros. Analysis of an ATM Statistical Multiplexer with Heterogeneous Markovian On/Off Sources and Applications to Call Admission Control. Journal of High Speed Networks, vol. 6 no. 2, pp. 123–139, 1997.Google Scholar
  8. [9]
    A. Elwalid, D. Heyman, T. V. Lakshman, D. Mitra, and A. Weiss. Fundamental Bounds and Approximations for ATM Multiplexers with Applications to Video Teleconferencing. IEEE Journal on Selected Areas in Communications, 13:1004–1016, 1995.Google Scholar
  9. [10]
    A. Elwalid, D. Mitra, and R. H. Wentworth. A new Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node. IEEE Journal on Selected Areas in Communications, 13:1115–1127, 1995Google Scholar
  10. [11]
    V. Firoiu, J. Kurose, and D. Towsley, Efficient admission control for EDF Schedulers, IEEE Infocom’97, 1997.Google Scholar
  11. [12]
    E. Gelenbe, X. Mang, and R. Onvural, Diffusion based statistical call admission control in ATM, Performance Evaluation, vol. 27, 411–36, 1996.Google Scholar
  12. [13]
    R. Gu’erin, H. Ahmadi, M. Naghshineh, Equivalent capacity and its application to bandwidth allocation in high-speed networks, IEEE Journal on Selected Areas in Communications, vol. 9, 968–981, 1991.Google Scholar
  13. [14]
    S. Keshav, An Engineering Approach to Computer Networks, Chapter 9, Addison-Wesley, 1996.Google Scholar
  14. [15]
    V. Kulkarani, L. Gün, and P. Chimento, Effective bandwidth vector for two-priority ATM traffic, INFOCOM’ 94, 1056–1064, 1994.Google Scholar
  15. [16]
    S.-Q. Li. A General Solution Technique for Discrete Queueing Analysis of Multimedia Traffic on ATM. IEEE Transactions on Communications, 39:1115–1132, 1991.Google Scholar
  16. [17]
    J. Liebherr and D. E. Werge, Design and analysis of a high-performance packet multiplexer for multiservice networks, with delay guarantees, Technical report CS-94-03, University of Virginia, 1994.Google Scholar
  17. [18]
    J. Liebherr, D. E. Werge, and D. Ferrari, Exact admission control for networks with a bounded delay service, IEEE Trans. on Networking, vol. 4, 885–901, 1996.Google Scholar
  18. [19]
    A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE Trans. on Networking, vol. 2, 137–150, 1994.Google Scholar
  19. [20]
    C. Rasmussen, J.H. Sørensen, K.S. Kvols, and S.B. Jacobsen, Source-independent call acceptance procedures in ATM networks, IEEE JSAC 9, 351–358, 1991.Google Scholar
  20. [21]
    K. M. Rege. Equivalent Bandwidth and Related Admission Criteria for ATM Systems-A Performance Study. International Journal of Communications Systems, 7:181–197, 1994.Google Scholar
  21. [22]
    H. Saito, Call admission control in an ATM network using upper bound of cell loss probability, IEEE Trans. Comm. vol. 40, 1512–1521, 1992.CrossRefGoogle Scholar
  22. [23]
    G. De Veciana, G. Kesidis, and J. Walrand. Resource Management in Wide-Area ATM Networks Using Effective Bandwidth. IEEE Journal on Selected Areas in Communications, 13:1081–1090, 1995.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Khaled Elsayed
    • 1
  • Harry Perros
    • 2
  1. 1.Department of Electronics and Communications Engineering Faculty of EngineeringCairo UniversityGizaEgypt
  2. 2.Department of Computer ScienceNorth Carolina State UniversityRaleighUSA

Personalised recommendations