scholarly journals Analysis of AQM queues with queue size based packet dropping

2011 ◽  
Vol 21 (3) ◽  
pp. 567-577 ◽  
Author(s):  
Andrzej Chydziñski ◽  
Łukasz Chróst
Keyword(s):  
Size Distribution ◽  
Analytical Solutions ◽  
Queueing Systems ◽  
Queue Management ◽  
Queue Size ◽  
Loss Ratio ◽  
Packet Dropping ◽  
Numerical Examples ◽  
Internet Routers ◽  
Blocking Probabilities

Analysis of AQM queues with queue size based packet dropping Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities (dropping functions).

scholarly journals Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping

2016 ◽  
Vol 26 (4) ◽  
pp. 841-854 ◽  
Author(s):  
Oleg Tikhonenko ◽  
Wojciech M. Kempa
Keyword(s):  
Performance Evaluation ◽  
Size Distribution ◽  
Queueing System ◽  
Random Variables ◽  
Loss Probability ◽  
Queue Size ◽  
Packet Dropping ◽  
Numerical Examples ◽  
Explicit Formulae

Abstract A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.

Relations Among Moments of Waiting Time and Queue Size Distribution in Bulk Queueing Systems

1987 ◽  
Vol 36 (1-2) ◽  
pp. 63-68
Author(s):  
A. Ghosal ◽  
S. Madan ◽  
M.L. Chaudhry
Keyword(s):  
Size Distribution ◽  
Waiting Time ◽  
Queueing Systems ◽  
Queueing Models ◽  
Queue Size ◽  
Different Types

This paper brings out relations among the moments of various orders of the waiting time and the queue size in different types of bulk queueing models.

QLREDActive Queue Management Algorithm

2021 ◽  
Vol 28 (1) ◽  
Author(s):  
S.O. Hassan ◽  
A.O. Oluwatope ◽  
C. Ajaegbu ◽  
K-K.A. Abdullah ◽  
A.O. Olasupo
Keyword(s):  
Queue Size ◽  
Packet Dropping ◽  
Simulation Performance ◽  
Internet Routers ◽  
Dropping Probability ◽  
Management Algorithm ◽  
Traffic Loads ◽  
Probability Profile ◽  
Dropping Function ◽  
Minimal Effort

The Random Early Detection (RED) algorithm has not been successful in keeping the average queue size low. In this paper, we an improved RED-based algorithm called QLRED which divides the dropping probability function of the RED algorithm into two equal segments. The first segment utilises a quadratic packet dropping function while the second segment deploys a linear packet dropping function respectively so as to distinguish between light and high traffic loads. The ns-3 simulation performance evaluations clearly showed that QLRED algorithm effectively controls the average queue size under various network conditions resulting in a low delay. Replacing/upgrading the RED algorithm in Internet routers requires minimal effort since only the packet dropping probability profile needs to be adjusted.

Congestion Control Using Soft Computing

2010 ◽  
pp. 271-289
Author(s):  
T. Revathi ◽  
K. Muneeswaran
Keyword(s):  
Queue Length ◽  
Fuzzy Rule ◽  
Vital Role ◽  
Rate Of Change ◽  
Rule Base ◽  
Queue Management ◽  
Internet Routers ◽  
Fuzzy Rule Base ◽  
The Status

In the recent Internet era the queue management in the routers plays a vital role in the provision of Quality of Service (QoS). Virtual queue-based marking schemes have been recently proposed for Active Queue Management (AQM) in Internet routers. In this chapter, the authors propose Fuzzy enabled AQM (F-AQM) scheme where the linguistics variables are used to specify the behavior of the queues in the routers. The status of the queue is continuously monitored and decisions are made adaptively to drop or mark the packets as is done in Random Early Discard (RED) and Random Early Marking (REM) algorthms or schemes. The authors design a fuzzy rule base represented in the form of matrix indexed by queue length and rate of change of queue. The performance of the proposed F-AQM scheme is compared with several well-known AQM schemes such as RED, REM and Adaptive Virtual Queue (AVQ).

The disasters queue with working breakdowns and impatient customers

2020 ◽  
Vol 54 (3) ◽  
pp. 815-825
Author(s):  
Mian Zhang ◽  
Shan Gao
Keyword(s):  
Size Distribution ◽  
Performance Measures ◽  
Sojourn Time ◽  
Queue Length ◽  
Slow Rate ◽  
System Size ◽  
Impatient Customers ◽  
Numerical Examples ◽  
The Mean ◽  
Mean Queue Length

We consider the M/M/1 queue with disasters and impatient customers. Disasters only occur when the main server being busy, it not only removes out all present customers from the system, but also breaks the main server down. When the main server is down, it is sent for repair. The substitute server serves the customers at a slow rate(working breakdown service) until the main server is repaired. The customers become impatient due to the working breakdown. The system size distribution is derived. We also obtain the mean queue length of the model and mean sojourn time of a tagged customer. Finally, some performance measures and numerical examples are presented.

Sign in / Sign up

Export Citation Format

Share Document