Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
From MaRDI portal
Publication:6579134
DOI10.1007/s11134-024-09903-4zbMATH Open1544.9006MaRDI QIDQ6579134
Lisa Aoki Hillas, René Caldentey, Varun Gupta
Publication date: 25 July 2024
Published in: (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic independence of servers' activity in queueing systems with limited resource pooling
- On the instability of matching queues
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Heavy traffic resource pooling in parallel-server systems
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- On dynamic scheduling of a parallel server system with complete resource pooling
- Stability of the bipartite matching model
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- A Diffusion Regime with Nondegenerate Slowdown
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
- Stability of the stochastic matching model
- 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
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- Fcfs infinite bipartite matching of servers and customers
- A Queueing System with General-Use and Limited-Use Servers
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Resource pooling in queueing networks with dynamic routing
- Heavy Traffic Limit Theorems for Queues: A Survey
- Queuing Models with Lane Selection: A New Class of Problems
- Optimal control of assignment of jobs to processors under heavy traffic
- On the Optimal Design of a Bipartite Matching Queueing System
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
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)