TAIL PROBABILITIES IN QUEUEING PROCESSES
From MaRDI portal
Publication:5166398
DOI10.1142/S0217595914400077zbMath1291.90072arXiv1209.5604MaRDI QIDQ5166398
Publication date: 26 June 2014
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5604
supermarket modelrandomized load balancingQBD (quasi-birth-and-death) processMarkov chain of the \(GI/M/1\) typeMarkov chain of the \(M/G/1\) typework stealing model
Related Items (3)
Nonlinear Markov processes in big networks ⋮ On a doubly dynamically controlled supermarket model with impatient customers ⋮ Block-structured supermarket models
Cites Work
- Unnamed Item
- Unnamed Item
- Decay of tails at equilibrium for FIFO join the shortest queue networks
- Asymptotic independence of queues under randomized load balancing
- Stability of join the shortest queue networks
- On the analysis of randomized load balancing schemes
- Fast Jackson networks with dynamic routing
- Tail asymptotics for M/G/1 type queueing processes with subexponential increments
- Two Types ofRG-Factorizations of Quasi-birth-and-death Processes and Their Applications to Stochastic Integral Functionals
- Constructive Computation in Stochastic Models with Applications
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- On the asymptotic behaviour of the stationary distribution of markov chains of M/G/1-type
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Heavy-traffic asymptotic expansions for the asymptotic decay rates in theBMAP/G/1 queue
- Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
- Probability and Computing
- Light-tailed asymptotics of stationary probability vectors of Markov chains of GI/G/1 type
- Heavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 type
- Geometric and Subexponential Asymptotics of Markov Chains of M/G/1 Type
This page was built for publication: TAIL PROBABILITIES IN QUEUEING PROCESSES