Queues with Dropping Functions and Autocorrelated Arrivals

Pawel Mrozowski · Andrzej Chydziński

18 citations0/0 files storedMethodology And Computing In Applied Probability

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

We present an analysis of the queueing system in which arriving jobs are dropped with probability depending on the queue size. The arrivals are assumed to be autocorrelated and they are modeled by the Markov-modulated Poisson process. Both transient and stationary distributions of the queue size, as well as the system loss ratio and throughput are obtained. The analytical results are accompanied with numerical examples based on the autocorrelated traffic recorded in an IP computer network.

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 — 18 citations exist upstream.

References

1993The Markov-modulated Poisson process (MMPP) cookbook 1993Steady-state analysis of the MMPP/G/1/K queue 1993Parameter estimation for Markov modulated Poisson processes via the EM algorithm with time discretization 2011Analysis of AQM queues with queue size based packet dropping 2013A Direct Approach to Transient Queue-Size Distribution in a Finite-Buffer Queue with AQM 2006Transient analysis of the MMPP/G/1/K queue 2006Queue Size in a BMAP Queue with Finite Buffer 2002The M/G-G/1 Oscillating Queueing System

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.