Packetization and Aggregate Scheduling

Anne Bouillard 1, 2, * Nadir Farhi 3 Bruno Gaujal 4
* Corresponding author
2 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
4 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We present a new formalism for data packetization in Network Calculus. Packet curves are introduced to model constraints on the packet lengths of data flows. Indeed, a more precise knowledge of the packet characteristics can be efficiently exploited to get tighter performance bounds, specially when dealing with scheduling policies based on packet count, such as round-robin. A second use of packet curves is the packetization of a superposition of periodic flows. Finally, we show that packet curves can be used to compute a global service curve for the aggregate of several flows, with different service curves, sharing a unique queue.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00608852
Contributor : Anne Bouillard <>
Submitted on : Friday, July 15, 2011 - 12:16:03 PM
Last modification on : Thursday, September 5, 2019 - 1:24:17 AM
Long-term archiving on : Monday, November 12, 2012 - 11:05:51 AM

File

RR-7685.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00608852, version 1

Citation

Anne Bouillard, Nadir Farhi, Bruno Gaujal. Packetization and Aggregate Scheduling. [Research Report] RR-7685, INRIA. 2011, pp.24. ⟨inria-00608852⟩

Share

Metrics

Record views

791

Files downloads

311