Resource and connection admission control in real-time transport protocols

Shanzeng Guo; Nicolas D. Georganas

doi:10.1117/12.206042

14 March 1995 Resource and connection admission control in real-time transport protocols

Shanzeng Guo, Nicolas D. Georganas

Proceedings Volume 2417, Multimedia Computing and Networking 1995; (1995) https://doi.org/10.1117/12.206042
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States

Abstract

Support for real-time multimedia applications is becoming an essential requirement for future high-speed networks. Many of these real-time applications will require guaranteed quality of service (QoS) such as a bound on the maximum message delay and/or on the maximum message loss rate. This poses an exciting challenge to the high speed transport protocol design and implementations. In this paper, we study the resource and admission control algorithms for real-time transport connections, and give a necessary and sufficient condition for the schedulabiltiy of n real-time transport connections at a destination host under deadline scheduling policy for deterministic guarantees of QoS. We propose the deadline scheduling with interrupt points policy, under which we give a necessary and sufficient condition of the schedulability of n real-time transport connections for statistical guarantees of QoS. These necessary and sufficient conditions form the mathematical basis for the QoS guarantees in transport communication services. Based on the necessary and sufficient conditions, we give the connection admission control algorithms for deterministic guarantees and statistical guarantees of QoS respectively. We also calculate the buffer space needed for each real-time transport connection. Our results could be applied to other fields as well, such as real-time operating systems.

Citation Download Citation

Shanzeng Guo and Nicolas D. Georganas "Resource and connection admission control in real-time transport protocols", Proc. SPIE 2417, Multimedia Computing and Networking 1995, (14 March 1995); https://doi.org/10.1117/12.206042

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available