Skip to main content

Distributed admission control algorithms for real-time communication

  • Invited Papers
  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1996)

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

Included in the following conference series:

  • 145 Accesses

Abstract

The distributed algorithms that constitute the basis of several popular approaches to admission control for real-time (i.e., guaranteed-performance) connections in packet-switching networks are described. Separate descriptions are given for the cases of unicast connections and multicast connections, which require different algorithms for some of the parts of the procedure. Real-time connections are expected to be needed for good-quality transmission of continuous-media (audio and video) streams, and will be subject to controlled admission so as to avoid congestion.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Ferrari. “Client Requirements for Real-Time Communication Services,” IEEE Communications Magazine, vol. 28. n. 11, pp. 65–72, November 1990.

    Article  Google Scholar 

  2. D. Ferrari, “The Tenet Experience and the Design of Protocols for Integrated-Services Internetworks,” preprint published on the Web at URL http://www.tenet.berkeley. edu, July 1995.

    Google Scholar 

  3. D. Ferrari, “Should an Integrated-Services Internetwork be Connectionless or Connection-Oriented? A Position Paper,” Proc. 6th Int. Workshop on Network and Operating System Support for Digital Audio and Video, Zushi, Japan, pp. 3–4. April 1996.

    Google Scholar 

  4. D. Ferrari, A. Gupta, and G. Ventre, “Distributed Advance Reservation of Real-Time Connections,” Proc. 5th Int. Workshop on Network and Operating System Support for Digital Audio and Video, Durham, NH, pp. 15–26, April 1995.

    Google Scholar 

  5. D. Ferrari and D. C. Verma, “A Scheme for Real-Time Channel Establishment in Wide-Area Networks,” IEEE J. Selected Areas in Communications, vol. 8, n. 3, pp. 368–379, April 1990.

    Article  Google Scholar 

  6. C. Parris, H. Zhang, and D. Ferrari, “Dynamic Management of Guaranteed Performance Multimedia Connections,” Multimedia Systems, vol. 1, pp. 267–283, July 1994.

    Article  Google Scholar 

  7. R. Bettati, D. Ferrari, A. Gupta. W. Heffner, W. Howe, M. Moran, Q. Nguyen, and R. Yavatkar, “Connection Establishment for Multi-Party Real-Time Communication,” Proc. 5th Int. Workshop on Network and Operating System Support for Digital Audio and Video, Durham, NH, pp. 255–266, April 1995.

    Google Scholar 

  8. R. Bettati and A. Gupta, “Dynamic Resource Migration for Multiparty Real-Time Communication,” Proc. 16th Int. Conf. on Distributed Computing Systems. Hong Kong. pp. 646–655. May 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Özalp Babaoğlu Keith Marzullo

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferrari, D. (1996). Distributed admission control algorithms for real-time communication. In: Babaoğlu, Ö., Marzullo, K. (eds) Distributed Algorithms. WDAG 1996. Lecture Notes in Computer Science, vol 1151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61769-8_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-61769-8_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61769-3

  • Online ISBN: 978-3-540-70679-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics