Comments on "A deterministic approach to the end-to-end analysis of packet flows in connection oriented networks"
Year: 2000
Type: article
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.
DOI: 10.1109/90.836483
Authors: J.-Y. Le Boudec, G. Hebuterne
Institution: École Polytechnique Fédérale de Lausanne
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2107941657