Resource and connection admission control in real-time transport protocols with deterministic QoS guarantees

Real-time multimedia 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 highspeed transport protocol design and implementations. In this paper, we study the resource and connection admission control algorithms, and give the necessary and sufficient conditions for the schedulability, of n real-time transport connections at a destination host under preemptive and non-preemptive deadline scheduling policy for deterministic QoS guarantees. These necessary and sufficient conditions form the mathematical basis for the deterministic QoS guarantees in real-time transport communication services. On the basis of these necessary and sufficient conditions, we give the connection admission control algorithms for deterministic QoS guarantees. We also calculate the buffer space needed for each real-time transport connection. The results show that real-time transport connections with deterministic QoS guarantees can reserve the buffer space at the establishment phase, and no flow control mechanism is required during the data transport phase. Our results could be applied to other fields as well, such as real-time operating systems.