Packetization and Aggregate Scheduling
Packetization and Aggregate Scheduling
复制标题
分组和聚合调度
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
B. Gaujal
中科院分区：
文献类型：
--
作者：
Anne Bouillard;N. Farhi;B. Gaujal
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.
