Call admission control schemes under generalized processor sharing scheduling

Zhi Li Zhang, Zhen Liu, Jim Kurose, Don Towsley

Research output: Contribution to journalArticlepeer-review

22 Scopus citations


Provision of Quality-of-Service (QoS) guarantees is an important and challenging issue in the design of integrated-services packet networks. Call admission control is an integral part of the challenge and is closely related to other aspects of networks such as service models, scheduling disciplines, traffic characterization and QoS specification. In this paper we provide a theoretical framework within which call admission control schemes with multiple statistical QoS guarantees can be constructed for the Generalized Processor Sharing (GPS) scheduling discipline. Using this framework, we present several admission control schemes for both session-based and class-based service models. The theoretical framework is based on recent results in the statistical analysis of the GPS scheduling discipline and the theory of effective bandwidths. Both optimal schemes and suboptimal schemes requiring less computational effort are studied under these service models. The QoS metric considered is loss probability.

Original languageEnglish (US)
Pages (from-to)125-152
Number of pages28
JournalTelecommunication Systems
Issue number1-3
StatePublished - Dec 1 1997


Dive into the research topics of 'Call admission control schemes under generalized processor sharing scheduling'. Together they form a unique fingerprint.

Cite this