Dynamic Buffer Sizing for Out-of-Order Event Compensation for Time-Sensitive Applications

by   Wolfgang Weiss, et al.

Today's sensor network implementations often comprise various types of nodes connected with different types of networks. These and various other aspects influence the delay of transmitting data and therefore of out-of-order data occurrences. This turns into a crucial problem in time-sensitive applications where data must be processed promptly and decisions must be reliable. In this paper, we were researching dynamic buffer sizing algorithms for multiple, distributed and independent sources, which reorder event streams, thus enabling subsequent time-sensitive applications to work correctly. To be able to evaluate such algorithms, we had to record datasets first. Five novel dynamic buffer sizing algorithms were implemented and compared to state-of-the-art approaches in this domain. The evaluation has shown that the use of a dynamic time-out buffering method is preferable over a static buffer. The higher the variation of the network or other influences in the environment, the more necessary it becomes to use an algorithm which dynamically adapts its buffer size. These algorithms are universally applicable, easy to integrate in existing architectures, and particularly interesting for time-sensitive applications. Dynamic time-out buffering is still a trade-off between reaction time and out-of-order event compensation.


page 1

page 5

page 21

page 25


An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types

Buffer insertion is a popular technique to reduce the interconnect delay...

On Packet Reordering in Time-Sensitive Networks

Time-sensitive networks (IEEE TSN or IETF DetNet) may tolerate some pack...

Event Tables for Efficient Experience Replay

Experience replay (ER) is a crucial component of many deep reinforcement...

Quickest Detection of Dynamic Events in Networks

The problem of quickest detection of dynamic events in networks is studi...

Stepwise correlation of multivariate IoT event data based on first-order Markov chains

Correlating events in complex and dynamic IoT environments is a challeng...

Analysis of M2/M2/1/R,N Queuing Model for Multimedia over 3.5G Wireless Network Downlink

Analysis of an M2/M2/1/R, N queuing model for the multimedia transmissio...

An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions

In the reordering buffer management problem, a sequence of requests must...

Please sign up or login with your details

Forgot password? Click here to reset