On the deterministic approach to active queue management

Virtually all known active queue management (AQM) algorithms, except for the two-category classifier (TCC), operate by calculating packet dropping probabilities. The probabilistic approach involves the necessity of using a type of random number generation upon every packet arrival at the router. Eve...

Full description

Saved in:
Bibliographic Details
Published in:Telecommunication systems Vol. 63; no. 1; pp. 27 - 44
Main Authors: Chrost, Lukasz, Chydzinski, Andrzej
Format: Journal Article
Language:English
Published: New York Springer US 01.09.2016
Springer Nature B.V
Subjects:
Algorithms
Analysis
Artificial Intelligence
Bandwidths
Business and Management
Complexity
Computation
Computer Communication Networks
Design analysis
Electric communication systems
Energy consumption
Internet
IT in Business
Load
Management
Packet switched networks
Probability Theory and Stochastic Processes
Queues
Queuing
Routers
Studies
Telecommunications systems
Buffer management
Active queue management
Congestion control
ISSN:1018-4864, 1572-9451
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Virtually all known active queue management (AQM) algorithms, except for the two-category classifier (TCC), operate by calculating packet dropping probabilities. The probabilistic approach involves the necessity of using a type of random number generation upon every packet arrival at the router. Even if the generation of a single random value does not involve high computational complexity, the overhead becomes significant, considering the number of packets in a typical Internet environment. We propose a new AQM algorithm based on the deterministic approach. The algorithm offers a high throughput and a low loss ratio while maintaining a short and stable queue size. At the same time, the algorithm is of low computation complexity, which allows for energy-efficient implementations in routers. In addition to that, the proposed algorithm is universal—it provides high performance in a variety of distinct networking scenarios (diversified round-trip times, congestion levels, traffic types, etc.). Contrary to the TCC algorithm, the proposed algorithm does not make the decision whether to accept or drop the packet upon each packet arrival—the computation process is involved less frequently.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1018-4864
1572-9451
DOI:10.1007/s11235-015-9969-9