A Call-Level Access Control Strategy for Integrated Services Wireless Packet Networks

  • Franco Davoli
  • Piergiulio Maryni
  • Carlo Nobile
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 366)


A simple call admission control system for multiservice wireless networks is presented. By means of it, connection requests coming from different “classes” of traffic (i.e., voice, data) are regulated in order to meet a set of Quality of Service (QoS) constraints. The admission mechanisn works on two levels: a static and a dynamic one. The static level looks at “packet-level” QoS, such as cell loss and delay, while the dynamic level takes care of call dynamics and allows to drive the load of the system with respect to the various traffic classes. Whenever a connection recpiest for the n-th traffic class appears, both levels of control intervene and the call is accepted if both of them do not reject it. The decision at the static level is deterministic, and it is based on the concept of Schedulable Region; the decision at the dynamic level is probabilistic and it is based on the concept of Input Rate Region, which is explained in the paper. Results that show the performance of this control mechanism are presented.


Mobile Station Admission Control Connection Request Call Admission Control Traffic Class 
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]
    D. J. Goodman. Trends in cellular and cordless communications. IEEE Communications Magazine, 29(6):31–40, June 1991.CrossRefGoogle Scholar
  2. [2]
    D. J. Goodman. Cellular packet communications. IEEE Communications Magazine, 38(8):1272–1280, August 1991.Google Scholar
  3. [3]
    J.E. Wieselthier and A. Ephremides. Fixed- and movable-boundary channel-access schemes for integrated voice/data wireless networks. IEEE Trans. Communication, 43(1):64–74, January 1995.CrossRefGoogle Scholar
  4. [4]
    J.M. Hyman, A.A. Lazar, and G. Pacifici. Real-time scheduling with quality of service constraints. IEEE Journal on Selected Areas in Communications, 9(7):1052–1063, September 1991.CrossRefGoogle Scholar
  5. [5]
    R. Bolla, F. Davoli, A. Iscra, C. Nobile, and S. Zappatore. Analysis and performance comparison of the RRA-ISA multiple access protocol for packet voice and data cellular systems. In Proceeding of PIMRC95, pages 378–382, Toronto, September 1995.Google Scholar
  6. [6]
    M. Aicardi, G. Casalino, and F. Davoli. Independent Stations Algorithm for the maximization of one-step throughput in a multiaccess channel. IEEE Transactions on Communications, COM-35(8):795–800, August 1987.MathSciNetCrossRefGoogle Scholar
  7. [7]
    K.W. Ross. Multiservice Loss Models for Broadband Telecommunication Networks. Springer, 1995.zbMATHGoogle Scholar
  8. [8]
    S. Jordan and P.P. Varaiya. Control of multiple service, multiple resource communication networks. IEEE Trans. Communication, 42:2979–2988, November 1994.Google Scholar
  9. [9]
    J.M. Hyman, A.A. Lazar, and G.Pacifici. A separation principle between scheduling and admission control for broadband switching. IEEE Journal on Selected Areas in Communications, 11(4):605–616, May 1993.CrossRefGoogle Scholar
  10. [10]
    R. Warfield, S. Chan, A. Konheim, and A. Guillaume. Real-Time traffic estimation in ATM networks. In Proceeding of ITC 14, pages 907–916, 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers, Boston 1996

Authors and Affiliations

  • Franco Davoli
    • 1
  • Piergiulio Maryni
    • 1
  • Carlo Nobile
    • 1
  1. 1.Department of Communications, Computer and System SciencesDIST-University of GenovaGenovaItaly

Personalised recommendations