14 March 1995 Resource and connection admission control in real-time transport protocols
Author Affiliations +
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shanzeng Guo, Shanzeng Guo, Nicolas D. Georganas, Nicolas D. Georganas, } "Resource and connection admission control in real-time transport protocols", Proc. SPIE 2417, Multimedia Computing and Networking 1995, (14 March 1995); doi: 10.1117/12.206042; https://doi.org/10.1117/12.206042

Back to Top