Infoscience

Report

Comment on 'A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks'

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

Related material