Skip to main content
SpringerLink
Log in

Optimal Call Admission Control under Generalized Processor Sharing Scheduling

  • Conference paper
  • First Online:
Quality of Service — IWQoS 2001 (IWQoS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2092))

Included in the following conference series:

Abstract

In this paper the problem of Call Admission Control is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound), served by a Generalized Processor Sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is applicable, under slight modification, in a system where the best effort traffic is absent and capable of guaranteeing that a solution to the CAC problem does not exist, if not found. The provided numerical results indicate that the presented algorithm can achieve, under certain conditions, a significant improvement on bandwidth utilization compared to a (deterministic) effective bandwidth based CAC scheme.

This work has been supported in part by the G.S.R.D. of Greece under grant PENED99 (99ED 92) and the IST Program of the EU IST-1999-10160.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Parekh and R. Gallager A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, 1(3):344–357, June 1993.

    Article  Google Scholar 

  2. A. Parekh and R. Gallager A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Transactions on Networking, 2(2):137–150, April 1994.

    Article  Google Scholar 

  3. R. Szabó, P. Barta, F. Németh, and J. Biró Call admission control in generalized processor sharing (gps) schedulers using non-rate proportional weighting of sessions. Proceedings of IEEE INFOCOM, 3:1243–1252, March 2000.

    Google Scholar 

  4. A. Elwalid and D. Mitra Design of generalized processor sharing schedulers which statistically multiplex heterogeneous qos classes. In Proceedings of IEEE INFOCOM, pages 1220–1230, March 1999.

    Google Scholar 

  5. Z. Zhang, D. Towsley, and J. Kurose Statistical analysis of the generalized processor sharing scheduling discipline. Proc. of ACM SIGCOMM, September 1994.

    Google Scholar 

  6. Z. Zhang, Z. Liu, J. Kurose, D. Towsley Call admission control schemes under the generalized processor sharing scheduling. The Journal of Telecommunication Systems, Modeling, Analysis, Design, and Management, 7(1), July 1997.

    Google Scholar 

  7. Z. Zhang, Z. Liu, and D. Towsley Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline. Journal of Combinatorial Optimization (Special Issue on Scheduling), 1(4), 1998.

    Google Scholar 

  8. R. Szabo, P. Barta, J. Biró, F. Németh, and C-G. Perntz Non-rate proportional weighting of genaralized processor sharring schedulers. Proceedings of GLOBECOM,2:1334–1339, December 1999.

    Google Scholar 

  9. J.-Y. Le Boudec Application of networkcalcu lus to guaranteed service networks. IEEE Transactions on Information Theory, 44(3):1087–1096, May 1998.

    Article  MATH  Google Scholar 

  10. L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan Efficient networkq os provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking,4(4):482–501, August 1996.

    Article  Google Scholar 

  11. A. Panagakis and I. Stavrakakis Optimal call admission control under generalized processor sharing scheduling. Technical report, available at http://www.di.uoa.gr/~istavrak/pub/gps.ps, 2001.

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Athens, 15784, Athens, Greece

    Antonis Panagakis & Ioannis Stavrakakis

Authors
  1. Antonis Panagakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioannis Stavrakakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics and Computing Center Institute of Telematics, University of Karlsruhe, Zirkel 2, 76128, Karlsruhe, Germany

    Lars Wolf

  2. Faculty of Applied Sciences, Computing Department, Lancaster University, Lancaster, LA1 4YR, UK

    David Hutchison

  3. GMD IPSI, German National Research Center for Information Technology Integrated Publication and Information Systems, Dolivostr. 15, 64293, Darmstadt, Germany

    Ralf Steinmetz

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panagakis, A., Stavrakakis, I. (2001). Optimal Call Admission Control under Generalized Processor Sharing Scheduling. In: Wolf, L., Hutchison, D., Steinmetz, R. (eds) Quality of Service — IWQoS 2001. IWQoS 2001. Lecture Notes in Computer Science, vol 2092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45512-4_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-45512-4_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42217-4

  • Online ISBN: 978-3-540-45512-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation