Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
From MaRDI portal
Publication:2220355
Abstract: In recent years a number of models involving different compatibilities between jobs and servers in queueing systems, or between agents and resources in matching systems, have been studied, and, under Markov assumptions and appropriate stability conditions, the stationary distributions have been shown to have product forms. We survey these results and show how, under an appropriate detailed description of the state, many are corollaries of similar results for the Order Independent Queue. We also discuss how to use the product form results to determine distributions for steady-state response times.
Recommendations
Cites work
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS
- A distributional form of Little's law
- A loss system with skill-based servers under assign to longest idle server policy
- A product form solution to a system with multi-type jobs and multi-type servers
- A queueing loss model with heterogeneous skill based servers under idle time ordering policies
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- A survey on skill-based routing with applications to service operations management
- Exact FCFS matching rates for two infinite multitype sequences
- Fcfs infinite bipartite matching of servers and customers
- Job replication on multiserver systems
- Matching queues with reneging: a product form solution
- Networks of Waiting Lines
- Order independent loss queues
- Order independent queues
- Partial flexibility in routeing and scheduling
- Quasi-reversible multiclass queues with order independent departure rates
- Queue-and-idleness-ratio controls in many-server service systems
- Queueing with redundant requests: exact analysis
- Redundancy scheduling with scaled Bernoulli service requirements
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- Reversibility and further properties of FCFS infinite bipartite matching
- Service-level differentiation in many-server service systems via queue-ratio routing
- The Distributional Little's Law and Its Applications
- The equivalence between processor sharing and service in random order.
- Understanding the marginal impact of customer flexibility
Cited in
(19)- Power-of-two sampling in redundancy systems: the impact of assignment constraints
- A survey on skill-based routing with applications to service operations management
- Editorial introduction: Special issue on product forms, stochastic matching, and redundancy
- Efficient scheduling in redundancy systems with general service times
- The cost of collaboration
- Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
- Stability regions of systems with compatibilities and ubiquitous measures on graphs
- Parallel multi-type many server conjecture
- On the sub-additivity of stochastic matching
- Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancy
- New directions in pass-and-swap queues
- Performance paradox of dynamic matching models under greedy policies
- Stochastic non-bipartite matching models and order-independent loss queues
- A product form solution to a system with multi-type jobs and multi-type servers
- Directed FCFS infinite bipartite matching
- Matching queues with reneging: a product form solution
- Pass-and-swap queues
- A Survey of Stability Results for Redundancy Systems
- Skipping and fetching: insights on non-conventional product-form solutions
This page was built for publication: Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220355)
