| Abstract: | In this paper, we analyse upper bounds on the end‐to‐end delay and the required buffer size at the leaky bucket and packet switches within the network in the context of the deterministic bandwidth allocation method in integrated services packet networks. Based on that formulation, we then propose a CAC method suitable to ISPN to guarantee the bounded end‐to‐end delay and loss‐free packet transmissions. As an example application, the GOP–CBR MPEG‐2 is considered. In that case, we also show tighter bounds by slightly modifying the coding method of GOP–CBR MPEG‐2. Using the actual traced data of GOP–CBR MPEG‐2, we discuss the applicabilities of our analytical results and proposed CAC by comparing with simulation. 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. Copyright © 2000 John Wiley & Sons, Ltd. |
