Large tandem queueing networks with blocking
An infinite system of queues is considered, such that queue 0 has infinite capacity and queues \(1,2,\ldots\) finite capacity \(c\) and a maximal number \(b\) of already served customers allowed to stay at the queue (otherwise queues \(0,1,2,\ldots\) are identical). First a functional limit theorem for the \(D(n,k)\), the departure time of customer \(n\) from queue \(k\), is given and describe informally the front wave of customers moving through an initial empty system. The result is the same as the corresponding infinite capacity result derived by Glynn and Whitt (1991). Next stochastic monotonicity properties of waiting time sequences are given. Finally the existence of a growth function \(\gamma(x)\) such that \(D(\lfloor xk\rfloor,k)/k\to\gamma(x)\) as \(k\to\infty\) is shown. The proofs involve recurrence relations, paths representations and results on so-called greedy lattice animals. Also the connection to certain types of percolation is discussed.
- Tandem queues with subexponential service times and finite buffers
- Large number of queues in tandem: scaling properties under back-pressure algorithm
- Large deviations for tandem queueing systems
- Transient behaviour of finite capacity tandem queues with blocking
- scientific article; zbMATH DE number 4048817
- Large deviations for tandem queueing systems
- The existence of fixed points for the \(\cdot\)/GI/1 queue.
- The attractiveness of the fixed points of a \(\cdot/\text{GI}/1\) queue.
- Limiting shape for directed percolation models
- Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
- Interference queueing networks on grids
- Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
- Tandem queueing networks with neighbor blocking and back-offs
- Generalized Lindley-type recursive representations for multiserver tandem queues with blocking
- Throughput scalability analysis of fork-join queueing networks
- On Decomposition Methods for Tandem Queueing Networks with Blocking
- A Tandem Queue with Server Slow-Down and Blocking
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Loss tandem networks with blocking -- a semi-Markov approach
- Tandem queues with subexponential service times and finite buffers
- Large number of queues in tandem: scaling properties under back-pressure algorithm
- Linear loss networks
- On product form tandem structures
- Heavy tails in last-passage percolation
This page was built for publication: Large tandem queueing networks with blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1605045)
