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 net-works 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 deter-ministic QoS guaranteed service.
CITATION STYLE
Urvoy, G., Hébuterne, G., & Dallery, Y. (2000). Deterministic end-to-end delay bounds in an accumulation network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1815, pp. 740–751). Springer Verlag. https://doi.org/10.1007/3-540-45551-5_62
Mendeley helps you to discover research relevant for your work.