Resource and Connection Admission Control in Real-time Transport Protocols

For determining the feasibility of offering real-time services in transport communications, the resource and admission control algorithms was proposed for real-time transport connections. A necessary and sufficient condition for the schedulability of n real-time transport connections was given for deterministic guarantees and statistical guarantees of QoS (Quality of Service). The buffer space needed for each real-time transport connection was also calculated. These results are beneficial for the high-speed transport protocol design and implementations.