Bounded-delay and loss-free guarantees for real-time video in integrated services packet networks

This paper provides upper bounds on the end-to-end delay and the required buffer size at the leaky bucket and packet switches in the context of the deterministic bandwidth allocation method in integrated services packet networks. Based on that formulation, a connection admission control (CAC) method is proposed to guarantee the bounded end-to-end delay and loss-free packet transmissions. GOP-CBR MPEG-2 and is considered as an example application. Tighter bounds are also shown for its slightly modified coding method. Numerical results show that the loose upper bounds can also achieve more utilization even in the context of deterministic bandwidth allocation compared with the peak bandwidth allocation strategy.