Packetization and packet curves in network calculus

Arrival and service curves are core functions in the Network Calculus framework [2], [3]. 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 ex...

Full description

Saved in:
Bibliographic Details
Main Authors: Bouillard, A., Farhi, N., Gaujal, B.
Format: Conference Proceeding
Language:eng ; jpn
Subjects:
Calculus
Tin
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Arrival and service curves are core functions in the Network Calculus framework [2], [3]. 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. Details and proofs can be found in [1].
DOI:10.4108/valuetools.2012.250208