Limit theorems for queueing networks with multichannel stations
Limit theorems in probability theory (60F99) Discrete-time Markov processes on general state spaces (60J05) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
The ergodic theorems for open and closed networks with multiserver nodes are proved. In the considered case the queueing system is described by one (for open net) or one from two (for closed net) Markov process. The servicing discipline is ``first-come, first-served.
- Ergodicity of partially accessible multichannel communication systems
- Wide sense regenerative processes with applications to multi-channel queues and networks
- Multiplicativity of a stationary distribution of an open queueing network with standard nodes and single-type calls
- New product theorems for queueing networks
- Multichannel queueing systems with regenerative input flow
- scientific article; zbMATH DE number 3852177 (Why is no real title available?)
- A simple proof of a result of Iglehart and Shedler
- scientific article; zbMATH DE number 3949460 (Why is no real title available?)
- scientific article; zbMATH DE number 4030671 (Why is no real title available?)
- Распространение хаоса в сетях обслуживания
- scientific article; zbMATH DE number 1014707 (Why is no real title available?)
- scientific article; zbMATH DE number 1165680 (Why is no real title available?)
- Limit Theorems for Queueing Networks. I
- scientific article; zbMATH DE number 879758 (Why is no real title available?)
- Open queueing networks in discrete time -- some limit theorems
- Bounds on the stability of the stationary distribution of the number of busy channels in the system GI\(| GI| \infty\)
This page was built for publication: Limit theorems for queueing networks with multichannel stations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179617)
