Packetization and Packet Curves in Network Calculus

Abstract : Arrival and service curves are core functions in the Network Calculus framework. Based on those curves, we present in this talk a new formalism for data packetization in Network Calculus, the packet curves. Indeed, a more precise knowledge of the packet characteristics can be efficiently exploited to get tighter performance bounds, for example for aggregation of flows, packet-based service policies and shared buffers. Finally, we will give a model for a wormhole switch and show how our results can be used to get efficient delay bounds.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-00780073
Contributor : Anne Bouillard <>
Submitted on : Wednesday, January 23, 2013 - 10:24:44 AM
Last modification on : Saturday, December 15, 2018 - 1:49:36 AM

Identifiers

  • HAL Id : hal-00780073, version 1

Citation

Anne Bouillard, Nadir Farhi, Bruno Gaujal. Packetization and Packet Curves in Network Calculus. VALUETOOLS - Sixth International Conference on Performance Evaluation Methodologies and Tools, Oct 2012, Cargèse, France. ⟨hal-00780073⟩

Share

Metrics

Record views

633