Loading...
report
Comment on 'A Deterministic Approach to the End-to-end Analysis of Packet Flows in Connection Oriented Networks'
1999
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.
Loading...
Name
TR99_014.pdf
Access type
openaccess
Size
174.13 KB
Format
Adobe PDF
Checksum (MD5)
d4d07d6bd94cb620bdfe95753625dbeb