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 480
- Downloads 0
Device-to-Device Communications for 5G Internet of Things
The proliferation of heterogeneous devices connected through large-scale networks is a clear sign that the vision of the Internet of Things (IoT) is getting closer to becoming a reality. Many researchers and experts in t...
The M/G/1 queueing model with preemptive random priorities
For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the...
Authorization-based Approach for Customized Automated Resource Provisioning Services
Combining the concept of software control with existing legacy network technology promotes new networking services with low capital expenditure. Currently, many testbeds and academic operators provide bandwidth on demand...
Drone Package Delivery: A Heuristic approach for UAVs path planning and tracking
In this paper we propose a new approach based on a heuristic search for UAVs path planning with terrestrial wireless network tracking. In a previous work we proposed and exact solution based on an integer linear formulat...
BER and NCMSE based Estimation algorithms for Underwater Noisy Channels
Channel estimation and equalization of sparse multipath channels is a real matter of concern for researchers in the recent past. Such type of channel impulse response is depicted by a very few significant non-zero taps t...