Bandwidth allocation under end‐to‐end percentile delay bounds

Abstract

SUMMARYWe 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 delay D is less than or equal to a given value T with 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 MarkovModulated 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 that P(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%.

Bandwidth estimation for video streaming under percentile delay, jitter, and packet loss rate constraints using traces

“…In the Jabber case, the graphs behave similarly to the WebEx case. Finally, as the end-to-end percentile delay constraint is relaxed, the required bandwidth graph becomes closer to the average bandwidth graph, as expected (see Anjum [4] for numerical results).…”

“…Central to the proposed schemes is the calculation of the departure process of the tagged MMPP stream by a two-state MMPP calculated using the first three moments of the inter-departure time and the lag 1 autocorrelation of the successive inter-departure times. Anjum et al [2] considered a tandem queueing network of infinite capacity queues with a two-state MMPP tagged arrival process and exponentially distributed service times. No background traffic was considered.…”

“…Using this method, they calculated the required bandwidth that should be allocated on each link along the path to satisfy a given percentile of the end-to-end delay. The algorithm proposed in [2] was extended in Anjum and Perros [3] to the case where the tagged arrival process is a two-stage Markovian Arrival Process (MAP2). The authors showed experimentally that the MAP2 is a good model for a video trace.…”

Impact of Packet Sampling on Link Dimensioning

“…On one hand, many approaches are technology-specific, e.g., in [10] the authors proposed a procedure to allocate bandwidth for delay sensitive applications along a MPLS path. On the other hand, generic approaches have different goals, e.g., [11] focuses on packet delay, [2], [3], [12] on link rate exceedance and [13] on packet loss.…”

The effectiveness of throughput sampling for capacity management: A queueing approach

“…Besides link loads also more detailed information regarding network performance may be used for capacity management, e.g. packet delays or buffer occupancies [2], [3]. In access networks, in particular, additional information regarding network usage is often obtained via throughput sampling ('speed tests', see e.g.…”