Comment on 'A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks'
Le Boudec, Jean-Yves; Hébuterne, G.
1999

Files

Abstract

We prove that the buffer bound in [CFZF98] can be improved, by using a modification of the proofs in the original paper [CFZF98], together with so-called network calculus bounds. We also show that the delay bound in [CFZF98] is the sum of worst case queuing delays at all nodes along the path of a connection.

Details

Title Comment on 'A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks'
Author(s) Le Boudec, Jean-Yves ; Hébuterne, G.
Date 1999
Laboratories LCA
LCA2
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IC Archives > LCA - Laboratory for Computer Communications and Applications
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LCA2 - Computer Communications and Applications Laboratory 2
Work produced at EPFL
Technical Reports
Published
Record creation date 2004-08-31

Actions

Preview