Delay Bounds Calculus for Variable Length Packet Transmissions under Flow Transformations
Delay Bounds Calculus for Variable Length Packet Transmissions under Flow Transformations
复制标题
流变换下可变长度数据包传输的延迟界限计算
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
J. Schmitt
中科院分区：
文献类型：
--
作者：
Hao Wang;J. Schmitt
网络演算的一个基本贡献是网络的卷积形式表示，它实现了严格的端到端延迟界限。最近，这已经扩展到数据流在其到达目的地的途中受到转换的情况。然而，基于所谓的缩放元素的扩展仅适用于相同大小的数据单元的设置，例如比特。当然，在实践中，人们经常不得不处理可变长度的分组。因此，在本文中，我们针对这种情况，提出了两种新的方法来推导经流变换的可变长度分组的延迟界。一种是对现有工作的相对直接扩展，另一种是对打包效应的更详细的处理。在数值评估中，我们展示了后一种方法的明显优势，并通过仿真结果验证了其界。
A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject to transformations on its way to the destination. Yet, the extension, based on so-called scaling elements, only applies to a setting of identically sized data units, e.g., bits. In practice, of course, one often has to deal with variable-length packets. Therefore, in this paper, we address this case and propose two novel methods to derive delay bounds for variable-length packets subject to flow transformations. One is a relatively direct extension of existing work and the other one represents a more detailed treatment of packetization effects. In a numerical evaluation, we show the clear superiority of the latter one and also validate the bounds by simulation results.