Queueing systems with renovation vs. queues with RED. Supplementary Material

09/05/2017
by   Mikhail Konovalov, et al.
0

In this note we consider M/D/1/N queue with renovation and derive analytic expressions for the following performance characteristics: stationary loss rate, moments of the number in the system. Moments of consecutive losses, waiting/sojourn time are out of scope. The motivation for studying these characteristics is in the comparison of renovation with known active queue mechanisms like RED.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2006

Managing network congestion with a Kohonen-based RED queue

The behaviour of the TCP AIMD algorithm is known to cause queue length o...
research
07/15/2019

Compound TCP with Random Early Detection (RED): stability, bifurcation and performance analyses

The problem of increased queueing delays in the Internet motivates the s...
research
07/18/2020

Languages for modeling the RED active queue management algorithms: Modelica vs. Julia

This work is devoted to the study of the capabilities of the Modelica an...
research
01/04/2022

New RED-type TCP-AQM algorithms based on beta distribution drop functions

In recent years, Active Queue Management (AQM) mechanisms to improve the...
research
02/09/2021

Stationary Distribution Convergence of the Offered Waiting Processes in Heavy Traffic under General Patience Time Scaling

We study a sequence of single server queues with customer abandonment (G...
research
08/16/2020

Erlang Redux: An Ansatz Method for Solving the M/M/m Queue

This exposition presents a novel approach to solving an M/M/m queue for ...

Please sign up or login with your details

Forgot password? Click here to reset