Many-server scaling of the N-system under FCFS-ALIS
From MaRDI portal
Publication:1698765
DOI10.1007/s11134-017-9549-7zbMath1390.60338arXiv1603.03571OpenAlexW2962738222MaRDI QIDQ1698765
Publication date: 16 February 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03571
fluid limitscentral limitsfirst come first servedassign to the longest idle servermany-server scalingN-system
Related Items (4)
Parallel multi-type many server conjecture ⋮ Design heuristic for parallel many server systems ⋮ Matching queues with reneging: a product form solution ⋮ Power-of-two sampling in redundancy systems: the impact of assignment constraints
Cites Work
- Unnamed Item
- A product form solution to a system with multi-type jobs and multi-type servers
- Exact asymptotics for the stationary distribution of a Markov chain: a production model
- Comparing ordered-entry queues with heterogeneous servers
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Stability analysis of N-model systems under a static priority rule
- Heavy traffic resource pooling in parallel-server systems
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic
- Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing
- Queue-and-Idleness-Ratio Controls in Many-Server Service Systems
- Fcfs infinite bipartite matching of servers and customers
- A Queueing System with General-Use and Limited-Use Servers
- Fluid Models of Parallel Service Systems Under FCFS
- Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy
- Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
- Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
This page was built for publication: Many-server scaling of the N-system under FCFS-ALIS
