Calculating end-to-end queuing delay for real-time services on an IP network

Authors:
Robert E. Kooij;Olaf Østerbø;J. C. Van Der Wal
Affiliations:
TNO Telecom, Leidschendam, The Netherlands;Telenor Research, Fornebu, Norway;Independent Consultant, Delft, The Netherlands
Venue:
Art-QoS'03 Proceedings of the 2003 international conference on Architectures for quality of service in the internet
Year:
2003

Citing 3
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Traffic distortion and inter-source cross-correlation in high-speed integrated networks

Computer Networks and ISDN Systems

Bandwidth allocation under end-to-end percentile delay bounds

International Journal of Network Management

Quantified Score

Hi-index	0.00

Visualization

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.