On the deterministic approach to active queue management

Chrost, Lukasz; Chydziñski, Andrzej

doi:10.1007/s11235-015-9969-9

Cited by 20 publications

(9 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, a large number of studies were carried out on systems, in which the packet dropping probability is not a simple function of the queue length, but depends on several other factors, often in a very complex way (see e.g. [12–20]). In networking, this is called the active queue management (AQM).…”

Section: Introductionmentioning

confidence: 99%

Queues with Dropping Functions and General Arrival Processes

Chydziñski

Mrozowski

2016

PLoS ONE

Self Cite

View full text Add to dashboard Cite

In a queueing system with the dropping function the arriving customer can be denied service (dropped) with the probability that is a function of the queue length at the time of arrival of this customer. The potential applicability of such mechanism is very wide due to the fact that by choosing the shape of this function one can easily manipulate several performance characteristics of the queueing system. In this paper we carry out analysis of the queueing system with the dropping function and a very general model of arrival process—the model which includes batch arrivals and the interarrival time autocorrelation, and allows for fitting the actual shape of the interarrival time distribution and its moments. For such a system we obtain formulas for the distribution of the queue length and the overall customer loss ratio. The analytical results are accompanied with numerical examples computed for several dropping functions.

show abstract

Section: Introductionmentioning

confidence: 99%

Queues with Dropping Functions and General Arrival Processes

Chydziñski

Mrozowski

2016

PLoS ONE

Self Cite

View full text Add to dashboard Cite

show abstract

“…Meanwhile, without considering the network dynamic behavior and its time-varying nature, the RED algorithm, its alternatives, and the aforementioned heuristic algorithms cannot provide the appropriate efficiency and performance and cannot guarantee stable behavior over a wide range of network conditions [8]. Development of the control theory in engineering and optimization and resource allocation theory in the economy have opened up new horizons to explore the congestion problem.…”

Section: Related Workmentioning

confidence: 99%

A self-tuning controller for queuing delay regulation in TCP/AQM networks

Kahe

Jahangir

2018

Telecommun Syst

View full text Add to dashboard Cite

AQM router aims primarily to control the network congestion through marking/dropping packets which are used as congestion feedback in traffic sources to balance their flow rate. However, stabilizing queuing delay and maximizing link utilization have been considered as the main control objectives, especially in media dominated networks. Usually, most of the AQM algorithms are designed for a nominal operating point. However, time-varying nature of network parameters frequently violates their robustness bounds. In this paper, a self-tuning compensated PID controller is proposed to address the time-varying nature of network conditions caused by parameter variations and unresponsive connections. The proposed scheme consists of network parameter estimation and a self-tuning AQM. Traffic load, network delay, and bottleneck link capacity are the time-varying network parameters whose variation effects should be compensated by the controller gains adaptation. As the controller gains are simply and directly obtained from the dynamic model, the obtained self-tuning controller can reasonably adapt itself to different operating conditions, while preserving the simplicity of the PI controllers. Packet-level simulations using ns2 show the outperformance of the developed controller for both latency regulation and resource utilization.

show abstract

“…Some propositions are based on artificial neural networks (e.g., [ 8 ]), fuzzy logic (e.g., [ 9 ]) or genetic algorithms (e.g., [ 10 ]). In others, the dropping probability is replaced by a deterministic decision about each arriving packet, i.e., whether to drop it, or not [ 11 ].…”

Section: Introductionmentioning

confidence: 99%

On the Transient Queue with the Dropping Function

Chydziñski

2020

Entropy

Self Cite

View full text Add to dashboard Cite

We deal with a queueing system, in which arriving packets are being dropped with the probability depending on the queue size. Such a scheme is used in several active queue management schemes proposed for Internet routers. In this paper, we derive and analyze a selected transient characteristic of the model, i.e., the probability that in a given time interval the queue size is kept under a predefined level. As the main purpose of the discussed queueing scheme is to maintain the queue size low, this is a natural characteristic to study. In addition to that, the average time to reach a given level is derived. Theoretical results for both characteristics are accompanied by numerical examples. Among other things, they demonstrate that the transient behavior of the queue may vary significantly with the shape of the dropping function, even if the steady-state performance remains unaltered.

show abstract

On the deterministic approach to active queue management

Cited by 20 publications

References 42 publications

Queues with Dropping Functions and General Arrival Processes

Queues with Dropping Functions and General Arrival Processes

A self-tuning controller for queuing delay regulation in TCP/AQM networks

On the Transient Queue with the Dropping Function

Contact Info

Product

Resources

About