Loss bounds for a finite-capacity queue based on interval-wise traffic observation
From MaRDI portal
Publication:1007140
DOI10.1007/S11134-008-9091-8zbMath1158.60380OpenAlexW2057004200MaRDI QIDQ1007140
Publication date: 27 March 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-008-9091-8
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Traffic problems in operations research (90B20)
Cites Work
- Unnamed Item
- Unnamed Item
- Exponential bounds for queues with Markovian arrivals
- Large deviations, the shape of the loss curve, and economies of scale in large multiplexers
- Continuous Time Treatment of a Storage Problem
- A single-server queue with limited virtual waiting time
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Exponential upper bounds via martingales for multiplexers with Markovian arrivals
- MARKOV MODULATED FLUID QUEUES WITH BATCH FLUID ARRIVALS
- MONOTONICITY RESULTS FOR SINGLE-SERVER FINITE-CAPACITY QUEUES WITH RESPECT TO DIRECTIONALLY CONVEX ORDER
- Economies of scale in queues with sources having power-law large deviation scalings
- Buffer overflow asymptotics for a buffer handling many traffic sources
- A MARKOV MODULATED FLUID QUEUE WITH BATCH ARRIVALS AND PREEMPTIONS
This page was built for publication: Loss bounds for a finite-capacity queue based on interval-wise traffic observation
