Bandwidth allocation under end‐to‐end percentile delay bounds

SUMMARY We describe an efficient and accurate approximation method for calculating the bandwidth that should be allocated on each link along the path of a point‐to‐point Multiprotocol Label Switching connection, so that the end‐to‐end delayDis less than or equal to a given valueTwith a probabilityγ, that is,P(D ≤ T) = γ. We model a connection by a tandem queuing network of infinite capacity queues. The arrival process of packets to the connection is assumed to be bursty and correlated and it is depicted by a two‐stage Markov‐Modulated Poisson Process. The service times are exponentially distributed. The proposed method uses only the first queue of the tandem queuing network to construct an upper and lower bound of the required bandwidth so thatP(D ≤ T) = γ. Subsequently, we estimate the required bandwidth using a simple interpolation function between the two bounds. Extensive comparisons with simulation showed that the results obtained have an average relative error of 1.25%.