Busy periods in a system with heterogeneous servers or channels
From MaRDI portal
Publication:2432954
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15) Communication theory (94A05)
Recommendations
Cites work
- M/M/∞ transience revisited
- A perpetuity and the M/M/∞ ranked server system
- A Queueing Analysis of Hashing with Lazy Deletion
- Asymptotic coverage distributions on the circle
- Continued Fraction Analysis of the Duration of an Excursion in an M/M/∞ System
- Excursions of birth and death processes, orthogonal polynomials, and continued fractions
- scientific article; zbMATH DE number 3849168 (Why is no real title available?)
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- Linear birth and death models and associated Laguerre and Meixner polynomials
- Probability of heavy traffic period in third generation CDMA mobile communication
- Some results for infinite server poisson queues
- The busy period of the queueing system M/G/∞
- Transient characteristics of an M/M/∞ system
Cited in
(4)- Multiserver fully-available systems with repeat calls under conditions of heavy traffic
- Real-time system with homogeneous servers and nonidentical channels in steady-state
- On the distribution of a busy period for the many server Poisson queue
- Busy periods in M/M/\(\infty\) systems with heterogeneous servers
This page was built for publication: Busy periods in a system with heterogeneous servers or channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432954)