Subexponential asymptotics of a Markov-modulated random walk with queueing applications
From MaRDI portal
Recommendations
- Subexponential asymptotics for steady state tail probabilities in a single-server queue with regenerative input flow
- Subexponential asymptotics of the waiting time distribution in a single-server queue with multiple Markovian arrival streams
- Subexponential asymptotics of the BMAP/GI/1 queue
- On the subexponential properties in stationary single-server queues: a Palm-martingale approach
- A Markov-modulated M/G/1 queue. I: Stationary distribution
Cited in
(22)- How system performance is affected by the interplay of averages in a fluid queue with long range dependence induced by heavy tails
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
- Sampling at subexponential times, with queueing applications
- Self-similar communication models and very heavy tails.
- A note on the subexponential asymptotics of the stationary distribution of \(M/G/1\) type Markov chains
- Subexponential asymptotics of asymptotically block-Toeplitz and upper block-Hessenberg Markov chains
- Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains
- Light-tailed asymptotics of \(\mathrm{GI}/\mathrm{G}/1\)-type Markov chains
- The extremal behaviour over regenerative cycles for Markov additive processes with heavy tails
- Subexponential asymptotics of the stationary distributions of \(\mathrm{GI}/\mathrm{G}/1\)-type Markov chains
- A General Class of Closed Fork and Join Queues with Subexponential Service Times
- Efficient simulation and conditional functional limit theorems for ruinous heavy-tailed random walks
- Subexponential asymptotics for steady state tail probabilities in a single-server queue with regenerative input flow
- On the subexponential properties in stationary single-server queues: a Palm-martingale approach
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- A sufficient condition for the subexponential asymptotics of GI/G/1-type Markov chains with queueing applications
- Critical sizing of LRU caches with dependent requests
- Heavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 type
- Tandem queues with subexponential service times and finite buffers
- Local asymptotics of a Markov modulated random walk with heavy-tailed increments
- Least-recently-used caching with dependent requests
- Heavy-tailed limits for medium size jobs and comparison scheduling
This page was built for publication: Subexponential asymptotics of a Markov-modulated random walk with queueing applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4215681)
