Title :
Comments on "A deterministic approach to the end-to-end analysis of packet flows in connection oriented networks"
Author :
Le Boudec, Jean-Yves ; Hébuterne, Gérard
Author_Institution :
ICA, Ecole Polytech. Fed. de Lausanne, Switzerland
Abstract :
For original paper see Chlamtac et al. (IEEE/ACM Trans. Networking, vol.6, no.4, p.422-31, 1998 August). We prove that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called network calculus bounds. We also show that the delay bound in the above paper, is the sum of worst-case queueing delays at all nodes along the path of a connection.
Keywords :
asynchronous transfer mode; buffer storage; delays; queueing theory; buffer bound; connection oriented network; delay bound; deterministic approach; end-to-end analysis; network calculus bounds; packet flows; worst-case queueing delays; Calculus; Delay; Intelligent networks; Interference;
Journal_Title :
Networking, IEEE/ACM Transactions on
