The M/M/ service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
From MaRDI portal
(Redirected from Publication:796435)
The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
Recommendations
- Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
- Busy periods in M/M/\(\infty\) systems with heterogeneous servers
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- A new view of the heavy-traffic limit theorem for infinite-server queues
- The \(MMAP/M/R/0\) queueing system with reservation of servers operating in a random environment
- Heavy-traffic limits for many-server queues with service interruptions
- Further results for the M/M(a,\(\infty)/N\) batch-service system
- Heavy traffic limits for queues with many deterministic servers
- \(M/M/n/m\) queueing systems with non-identical servers
Cited in
(26)- Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
- Delay-minimizing capacity allocation in an infinite server-queueing system
- A model of channel allocation in multichannel local networks
- Mathematical theory of queueing networks
- Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
- A provably efficient algorithm for dynamic storage allocation
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- Second-order properties of the loss probability in \(M/M/s/s+c\) systems
- AN EMERGENCY FACILITY WITH MINIMAL ADMISSION
- Geometrical Optics and Models of Computer Memory Fragmentation
- A simple direct solution to a storage allocation model
- The distribution of wasted spaces in the M/M/∞ queue with ranked servers
- Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
- Asymptotic expansions for a stochastic model of queue storage
- The \(GR^{X_ n}/G_ n/\infty\) system: System size
- On a storage allocation model with finite capacity
- Sharp and simple bounds for the Erlang delay and loss formulae
- Storage allocation under processor sharing. I: Exact solutions and asymptotics
- Some exact and asymptotic solutions to single server models of dynamic storage
- Sunset over Brownistan
- Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions
- Transient Analysis for State-Dependent Queues with Catastrophes
- Stochastic service systems, random interval graphs and search algorithms
- Performance-based routing
- Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
- Stochastic Models of Queue Storage
This page was built for publication: The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796435)
