Invariant rate functions for discrete-time queues

DOI10.1214/aoap/1050689588zbMath1031.60080OpenAlexW2080285437MaRDI QIDQ1413674

Balaji Prabhakar, Neil O'Connell, Ayalvadi J. Ganesh

Publication date: 17 November 2003

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1050689588

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Large deviations (60F10)

Related Items (2)

The single server queue and the storage model: large deviations and fixed points ⋮ Batch queues, reversibility and first-passage percolation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear geodesic property is not generally preserved by a FIFO queue
• Large deviations of the sojourn time for queues in series
• Asymptotic results on infinite tandem queueing networks
• On the weak convergence of departures from an infinite series of \(\cdot{}/M /1\) queues
• Effective bandwidths: Call admission, traffic policing and filtering for ATM networks
• A large deviation principle with queueing applications
• Stability, queue length, and delay of deterministic and stochastic queueing networks
• Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
• On the input-output map of aG/G/1 queue
• Large deviations for departures from a shared buffer
• The information-theoretic capacity of discrete-time queues
• Large deviations and overflow probabilities for the general single-server queue, with applications

This page was built for publication: Invariant rate functions for discrete-time queues