The generalization of AQM algorithms for queueing systems with bounded capacity

Authors:
Oleg Tikhonenko;Wojciech M. Kempa
Affiliations:
Institute of Mathematics, Czestochowa University of Technology, Poland;Institute of Mathematics, Silesian University of Technology, Poland
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Year:
2011

Citing 6
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
A control theoretic approach to active queue management

Computer Networks: The International Journal of Computer and Telecommunications Networking
Generalized Erlang Problem for Service Systems with Finite Total Capacity

Problems of Information Transmission
Exponential-RED: a stabilizing AQM scheme for low- and high-speed TCP protocols

IEEE/ACM Transactions on Networking (TON)
Nonlinear RED: a simple yet efficient active queue management scheme

Computer Networks: The International Journal of Computer and Telecommunications Networking
REM: active queue management

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

A queueing system of the M/M/1/(∞,V) type with generally distributed packet volumes and bounded capacity (total packets volume) is considered. The queue length is controlled by means of the accepting function that enqueues the arriving packet with probability depending on the free capacity volume in the system at the pre-arrival epoch. Explicit representations for stationary probabilities are derived via solving the system of differential equations. Sample numerical results are attached in which stationary queue-size distributions with and without dropping packets are compared.