8483 articles  [version française]

inria-00608852, version 1

Packetization and Aggregate Scheduling

Anne Bouillard (Author to contact preferably) a12, Nadir Farhi () 3, Bruno Gaujal () b4

N° RR-7685 (2011)

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.

  • a –  Ecole Normale Supérieure de Paris - ENS Paris
  • b –  INRIA
  • 1:  Laboratoire d'informatique de l'école normale supérieure (LIENS)
  • CNRS : UMR8548 – Ecole normale supérieure de Paris - ENS Paris
  • 2:  TREC (INRIA Rocquencourt)
  • INRIA – Ecole normale supérieure de Paris - ENS Paris
  • 3:  Génie des Réseaux de Transport Terrestres et Informatique Avancée (IFSTTAR/GRETTIA)
  • IFSTTAR – Université Paris-Est Créteil Val-de-Marne (UPEC)
  • 4:  MESCAL (INRIA Grenoble Rhône-Alpes / LIG laboratoire d'Informatique de Grenoble)
  • CNRS : UMR5217 – INRIA – Université Joseph Fourier - Grenoble I – Université Pierre-Mendès-France - Grenoble II – Institut polytechnique de Grenoble (Grenoble INP)
  • Domain : Computer Science/Discrete Mathematics
    Computer Science/Performance and Reliability
  • Keywords : Network Calculus – packetization – scheduling – quality of service guarantees
  • Internal note : RR-7685
 
  • inria-00608852, version 1
  • oai:hal.inria.fr:inria-00608852
  • From: 
  • Submitted on: Friday, 15 July 2011 12:16:03
  • Updated on: Thursday, 5 January 2012 10:31:23