Many-server scaling of the N-system under FCFS-ALIS
From MaRDI portal
(Redirected from Publication:1698765)
Abstract: The N-System with independent Poisson arrivals and exponential server-dependent service times under first come first served and assign to longest idle server policy has explicit steady state distribution. We scale the arrival and the number of servers simultaneously, and obtain the fluid and central limit approximation for the steady state. This is the first step towards exploring the many server scaling limit behavior of general parallel service systems.
Recommendations
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Law of large numbers limits for many-server queues
- Systems with large flexible server pools: instability of ``natural load balancing
- Large-scale join-idle-queue system with general service times
- A load balancing system in the many-server heavy-traffic asymptotics
Cites work
- A Queueing System with General-Use and Limited-Use Servers
- A product form solution to a system with multi-type jobs and multi-type servers
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Blind fair routing in large-scale service systems with heterogeneous customers and servers
- Comparing ordered-entry queues with heterogeneous servers
- Dynamic control of \(N\)-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic
- Dynamic control of a make-to-order, parallel-server system with cancellations
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- 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
- Exact FCFS matching rates for two infinite multitype sequences
- Exact asymptotics for the stationary distribution of a Markov chain: a production model
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Fcfs infinite bipartite matching of servers and customers
- Fluid models of parallel service systems under FCFS
- Heavy traffic resource pooling in parallel-server systems
- On dynamic scheduling of a parallel server system with complete resource pooling
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Queue-and-idleness-ratio controls in many-server service systems
- Reversibility and further properties of FCFS infinite bipartite matching
- Service-level differentiation in many-server service systems via queue-ratio routing
- Stability analysis of N-model systems under a static priority rule
Cited in
(8)- Power-of-two sampling in redundancy systems: the impact of assignment constraints
- Design heuristic for parallel many server systems
- Large-scale join-idle-queue system with general service times
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Parallel multi-type many server conjecture
- Diffusion-scale tightness of invariant distributions of a large-scale flexible service system
- Matching queues with reneging: a product form solution
- Systems with large flexible server pools: instability of ``natural load balancing
This page was built for publication: Many-server scaling of the N-system under FCFS-ALIS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698765)
