End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2015, Vol 1, Issue 3
Abstract
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.
Authors and Affiliations
Hao Wang, Jens Schmitt
Keywords
Related Articles
- EP ID EP46464
- DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258194
- Views 506
- Downloads 0
An automated testbed for profiling the packet send-time accuracy of embedded devices
Embedded devices, such as home routers or single-board computers, are becoming more powerful and affordable. Many of the existing Linux-based network measurement tools can also be run on these devices through cross-compi...
Analysis of fibre-loop optical buffers with a void-avoiding schedule
In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to...
Managing HeterogeneousWSNs in Smart Cities: Challenges and Requirements
The dramatic advances in wireless communications and electronics have enabled the development of Wireless Sensor Networks (WSNs). WSNs consist of many a ordable and portable sensor nodes for collecting data from the envi...
End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
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 t...
TagFall: Towards Unobstructive Fine-Grained Fall Detection based on UHF Passive RFID Tags
Falls are among the leading causes of hospitalization for the elderly and illness individuals. Considering that the elderly often live alone and receive only irregular visits, it is essential to develop such a system tha...