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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Ahmed, R. Callon, A. Malis, and J. Moy. Ip switching for scalable ip services. Proceedings of the IEEE, 85(12), 1997.
J.-Y. Le Boudec. An application of network calculus to guaranteed service networks. IEEE/ACM Transactions on Information Theory, May 1998.
I. Chlamtac, A. Faragó, and H. Zhang. A deterministic approch to the end-to-end analysis of packet flows in connection-oriented networks. IEEE Trans. on Networking, August 1998.
D. D. Clark, S. Shenker, and L. Zhang. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. ACM SIGCOM’92, 1992.
R.L. Cruz. A calculus for network delay, part 1: network elements in isolation. IEEE Transaction on Information Theory, January 1991.
A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, June 1993.
A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case. IEEE/ACM Transactions on Networking, Mars 1994.
H. G. Perros and K. H Elsayed. Call admission control schemes: A review. IEEE Magazine on Communications, Nov. 1996.
K. Shiomoto, N. Yamanaka, and T. Takahashi. Overview of measurement-based connection admission control methods in atm networks. IEEE Communications Surveys, 1999.
G. Urvoy, G. Hébuterne, and Y. Dallery. Delay-constrained vbr sources in a network environment. In ITC’16, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urvoy, G., Hébuterne, G., Dallery, Y. (2000). Deterministic End-to-End Delay Bounds in an Accumulation Network. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_62
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive