End-to-end queuing delay assessment in multi-service ip networks

Vleeschauwer, Danny De; Buchli, M.; Moffaert, A. Van; Kooij, Robert E.

doi:10.1080/00949650214671

Cited by 6 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach was used by Xiong and Perros in the context of resource optimization of web services using a tandem queuing network with Poisson arrivals and exponentially distributed service times. Also, Vleeschauwer et al obtained the moment‐generating function of the end‐to‐end delay of N statistically independent M/G/1 nodes, which was then inverted numerically in order to compute delay percentiles. They also proposed two less complex and highly accurate approximations for percentile calculation, assuming that the individual queuing delays had an exponential tail distribution.…”

Section: Introductionmentioning

confidence: 99%

Bandwidth allocation under end‐to‐end percentile delay bounds

et al. 2011

View full text Add to dashboard Cite

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%.

show abstract

Section: Introductionmentioning

confidence: 99%

Bandwidth allocation under end‐to‐end percentile delay bounds

et al. 2011

View full text Add to dashboard Cite

show abstract

“…For non-deterministic packet size distributions in general it is not possible to use our method because there is no explicit expression for the waiting time distribution, such as (11). However, in this case one can use approximative methods, see [17]. Simulations for some "real" network scenarios, see [18],…”

Section: Discussionmentioning

confidence: 99%

“…In this paper we will only consider the case when all the nodes are identical, that is the network is homogeneous in the sense that all links have equal capacity and load. The case of a heterogeneous network is treated in [17] but there the data queues are not taken into account.…”

Section: Queueing Modelmentioning

confidence: 99%

Calculating End-to-End Queuing Delay for Real-Time Services on an IP Network

Kooij¹,

Østerbø

Wal³

2003

Architectures for Quality of Service in the Internet

View full text Add to dashboard Cite

Abstract.A crucial factor for real-time (interactive) services is the end-to-end delay experienced by the application. The contribution resulting from the queuing delay induced by the network nodes is the most difficult to assess. First, it is a stochastic quantity which should be aggregated over many (possibly different) network nodes. Secondly, the queuing delay in a single node stems from two different mechanisms: one related to interference with other interactive flows and one related to interference with the ubiquitous best-effort data flows. Earlier work assessed these two components separately, leading to a 'worst case' result. This paper models both components and develops formulas to calculate exact results for the end-to-end queuing delay. Results are shown indicating an improvement up to 45% over the worst-case method. The formulae developed in this paper are expected to be useful in network dimensioning, in setting network performance requirements and in admission control mechanisms.

show abstract

Bibliography

2014

Bandwidth Allocation for Video Under Quality of Service Constraints

View full text Add to dashboard Cite

End-to-end queuing delay assessment in multi-service ip networks

Cited by 6 publications

References 6 publications

Bandwidth allocation under end‐to‐end percentile delay bounds

Bandwidth allocation under end‐to‐end percentile delay bounds

Calculating End-to-End Queuing Delay for Real-Time Services on an IP Network

Bibliography

Contact Info

Product

Resources

About