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

Jean-Yves Le Boudec
1999
Rapport ou document de travail

Résumé

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.

Source officielle

https://infoscience.epfl.ch/record/52310?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

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

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Building Evolvable Networks

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Building Evolvable Networks