Level-Crossing Characteristics of an Actively Managed Buffer

In this paper, we examine a buffer with active management that rejects packets basing on the buffer occupancy. Specifically, we derive several metrics characterizing how effectively the algorithm can prevent the queue of packets from becoming too long and how well it assists in flushing the buffer q...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of sensor and actuator networks Ročník 13; číslo 2; s. 28
Hlavný autor: Chydzinski, Andrzej
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.04.2024
Predmet:
actively managed buffer
Algorithms
Analysis
buffer flush time
Buffers
Energy consumption
level-crossing probability
overflow probability
Queues
Queuing
Sensors
time to overflow
Wireless sensor networks
ISSN:2224-2708, 2224-2708
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we examine a buffer with active management that rejects packets basing on the buffer occupancy. Specifically, we derive several metrics characterizing how effectively the algorithm can prevent the queue of packets from becoming too long and how well it assists in flushing the buffer quickly when necessary. First, we compute the probability that the size of the queue is kept below a predefined level L. Second, we calculate the distribution of the amount of time needed to cross level L, the buffer overflow probability, and the average time to buffer overflow. Third, we derive the distribution of the amount of time required to flush the buffer and its average value. A general modeling framework is used in derivations, with a general service time distribution, general rejection function, and a powerful model of the arrival process. The obtained formulas enable, among other things, the solving of many design problems, e.g., those connected with the design of wireless sensor nodes using the N-policy. Several numerical results are provided, including examples of design problems and other calculations.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2224-2708
2224-2708
DOI:10.3390/jsan13020028