Skip to main content

A Call Admission Control Method for Supporting Telephony Sessions in a Best Effort IP Network

  • Conference paper
  • First Online:
Book cover Quality of Future Internet Services (QofIS 2001)

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

Included in the following conference series:

  • 228 Accesses

Abstract

An actively studied research area of the past couple of years is the design of connection admission control techniques for IP networks. This paper proposes a new, end-to-end measurement based approach for call admission control in IP telephony gateways. The method relies on measuring the quality experienced by ongoing live sessions: it collects packet loss and delay statistics about the sessions active between peer telephony gateways. This leads to very fast admission decision compared to existing methods, and also eliminates the signalling load and the maintenance of associated flow state in the core routers. The paper contributes to answering the fundamental question of what sort of QoS guarantees can be provided by a core-stateless QoS provisioning architecture, and it also investigates the effect of flows subjected to end-to-end measurement based admission control on legacy TCP traffic.

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

Access this chapter

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. E. Ekudden, S. Bruhn, and P. Sörqvist. The adaptive multi-rate speech coder-the new flexible world-standard for voice compression. In XVII. World Telecommunications Congress, Great Britain, May 2000.

    Google Scholar 

  2. V. Elek, G. Karlsson, and R. Rönngren. Admission control based on end-to-end measurements. In IEEE Infocom, Israel, April 2000.

    Google Scholar 

  3. G. Bianchi, A. Capone, and C. Petrioli. Throughput analysis of end-to-end measurement-based admission control in IP. In IEEE Infocom, Israel, April 2000.

    Google Scholar 

  4. IETF RFC 2205. Resource ReServation Protocol (RSVP), 1997.

    Google Scholar 

  5. IETF RFC 1889. RTP: A Transport Protocol for Real-Time Applications, 1996.

    Google Scholar 

  6. UCB/LBNL/VINT Network Simulator ns (version 2) can be found at: http://www-mash, cs.berkeley.edu/ns/ns.html.

  7. S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based congestion control for unicast applications. In ACM Sigcomm, Sweden, August 2000.

    Google Scholar 

  8. S. Deng. Traffic characteristics of packet voice. In IEEE International Conference on Communications, USA, June 1995.

    Google Scholar 

  9. ITU-T Recommendation G.114. General Characteristics of International Telephone Connections and International Telephone Circuits —One-way Transmission Time, 1996.

    Google Scholar 

  10. L. Breslau, E.W. Knigthly, S. Shenker, I. Stoica, and H. Zhang. Endpoint admission control: Architectural issues and performance. In ACM Sigcomm, Sweden, August 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szabó, I. (2001). A Call Admission Control Method for Supporting Telephony Sessions in a Best Effort IP Network. In: Smirnov, M.I., Crowcroft, J., Roberts, J., Boavida, F. (eds) Quality of Future Internet Services. QofIS 2001. Lecture Notes in Computer Science, vol 2156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45412-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45412-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42602-8

  • Online ISBN: 978-3-540-45412-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics