The M/M/ service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
zbMATH Open0543.90040MaRDI QIDQ796435FDOQ796435
Authors: Gordon Frank Newell 
Publication date: 1984
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
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
queueingasymptotic propertiesheavy trafficErlang distributionservice facilityequivalent random methodlarge number of servers in parallelnumber of busy serverstelephone traffic
Queues and service in operations research (90B22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cited In (26)
- Storage allocation under processor sharing. I: Exact solutions and asymptotics
- Stochastic Models of Queue Storage
- AN EMERGENCY FACILITY WITH MINIMAL ADMISSION
- Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
- Some exact and asymptotic solutions to single server models of dynamic storage
- Stochastic service systems, random interval graphs and search algorithms
- A model of channel allocation in multichannel local networks
- Asymptotic expansions for a stochastic model of queue storage
- Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions
- A provably efficient algorithm for dynamic storage allocation
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- A simple direct solution to a storage allocation model
- Performance-based routing
- Second-order properties of the loss probability in \(M/M/s/s+c\) systems
- Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
- Transient Analysis for State-Dependent Queues with Catastrophes
- Geometrical Optics and Models of Computer Memory Fragmentation
- The distribution of wasted spaces in the M/M/∞ queue with ranked servers
- Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
- Mathematical theory of queueing networks
- Sharp and simple bounds for the Erlang delay and loss formulae
- Sunset over Brownistan
- On a storage allocation model with finite capacity
- Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
- The \(GR^{X_ n}/G_ n/\infty\) system: System size
- Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System
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)
