Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
From MaRDI portal
Recommendations
- On the optimal design of a bipartite matching queueing system
- Design heuristic for parallel many server systems
- Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions
- Directed FCFS infinite bipartite matching
- Ergodic control of bipartite matching queues with class change and matching failure
Cites work
- A diffusion regime with nondegenerate slowdown
- A Queueing System with General-Use and Limited-Use Servers
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- Asymptotic independence of servers' activity in queueing systems with limited resource pooling
- Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Exact FCFS matching rates for two infinite multitype sequences
- Fcfs infinite bipartite matching of servers and customers
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Heavy Traffic Limit Theorems for Queues: A Survey
- Heavy traffic resource pooling in parallel-server systems
- Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- scientific article; zbMATH DE number 4076265 (Why is no real title available?)
- scientific article; zbMATH DE number 3206641 (Why is no real title available?)
- On dynamic scheduling of a parallel server system with complete resource pooling
- On the instability of matching queues
- On the optimal design of a bipartite matching queueing system
- Optimal control of assignment of jobs to processors under heavy traffic
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Queuing Models with Lane Selection: A New Class of Problems
- Resource pooling in queueing networks with dynamic routing
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Stability of the bipartite matching model
- Stability of the stochastic matching model
Cited in
(1)
This page was built for publication: Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579134)
