Deterministic End-to-End Delay Bounds in an Accumulation Network

Authors:
Guillaume Urvoy;Gérard Hébuterne;Yves Dallery
Affiliations:
-;-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 7
Cited 0

Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
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)
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks

IEEE/ACM Transactions on Networking (TON)
Overview of measurement-based connection admission control methods in ATM networks

IEEE Communications Surveys & Tutorials
Application of network calculus to guaranteed service networks

IEEE Transactions on Information Theory
Call admission control schemes: a review

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on the determination of end-to-end delay bounds for FIFO accumulation networks with leaky bucket constrained sources, including IP and ATM network cases. We determine an upper bound for the overall end-to-end delay and prove its accuracy to approximate the exact maximum end-to-end delay for accumulation networks of any size. This is achieved through an original trajectory analysis approach. Numerical studies further illustrate this point. This extends our previous results for the two-server and proves that this bound may be used as an accurate criterion for a CAC algorithm providing a deterministic QoS guaranteed service.