Analysis of AQM queues with queue size based packet dropping

Andrzej Chydziński · Łukasz Chróst

45 citations0/0 files storedInternational Journal of Applied Mathematics and Computer Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Age of Information Optimization

Abstract

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).

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 45 citations exist upstream.

References

1991brief review: Queueing Analysis: A Foundation of Performance Evaluation. Volume 1: Vacation and Priority Systems, Part 1 by H. Takagi (North-Holland, 1991)

Cited by

2020Multidimensional benchmarking of the active queue management methods of network congestion control based on extension of fuzzy decision by opinion score method 2014A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning 2016Queues with Dropping Functions and General Arrival Processes 2016Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping 2018The Single-Server Queue with the Dropping Function and Infinite Buffer 2012Queue-Size Distribution in M/G/1-Type System with Bounded Capacity and Packet Dropping 2020Queues With the Dropping Function and Non-Poisson Arrivals 2014Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.