Research Article
Packetization and Packet Curves in Network Calculus
@INPROCEEDINGS{10.4108/valuetools.2012.250208, author={Anne Bouillard and Nadir Farhi and Bruno Gaujal}, title={Packetization and Packet Curves in Network Calculus}, proceedings={6th International Conference on Performance Evaluation Methodologies and Tools}, publisher={IEEE}, proceedings_a={VALUETOOLS}, year={2012}, month={11}, keywords={network calculus packetization}, doi={10.4108/valuetools.2012.250208} }
- Anne Bouillard
Nadir Farhi
Bruno Gaujal
Year: 2012
Packetization and Packet Curves in Network Calculus
VALUETOOLS
ICST
DOI: 10.4108/valuetools.2012.250208
Abstract
Arrival and service curves re 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.
Copyright © 2012–2024 ICST