Large finite population queueing systems part i: the infinite server model.
From MaRDI portal
Publication:3822971
Recommendations
Cited in
(14)- Limit theorems for an infinite-server queuing system
- Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
- Law of large numbers limits for many-server queues
- Fluctuation bounds for sock-sorting and other stochastic processes
- Big jobs arrive early: from critical queues to random graphs
- Queues on a dynamically evolving graph
- Limit theorems for queueing systems with infinite number of servers and group arrival of requests
- Approximation of initial loading of infinite-server systems
- On many-server queues in heavy traffic
- On the fluid limit of the \(M / G /\infty\) queue
- System sizes in infinite server queues with constant service times
- Two-parameter heavy-traffic limits for infinite-server queues
- Large finite population queueing systems: The single-server model
- Limits for queues as the waiting room grows
This page was built for publication: Large finite population queueing systems part i: the infinite server model.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3822971)