Product Forms for FCFS Queueing Models with Arbitrary Server-Job Compatibilities: An Overview

@article{Gardner2020ProductFF,
  title={Product Forms for FCFS Queueing Models with Arbitrary Server-Job Compatibilities: An Overview},
  author={Kristen Gardner and Rhonda Righter},
  journal={Queueing Syst. Theory Appl.},
  year={2020},
  volume={96},
  pages={3-51}
}
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 existing product-form results are corollaries of similar results for the… 

Matching queues with reneging: a product form solution

A parallel matching queue with reneging is studied and explicit product forms of the steady state distributions of this system are derived by identifying a partial balance condition.

Pass-and-swap queues

Pass-and-swap is introduced and it is demonstrated that closed networks of P&S queues can be applied to describe the dynamics of new and existing load-distribution and scheduling algorithms in machine pools.

Directed FCFS infinite bipartite matching

  • G. Weiss
  • Mathematics
    Queueing Syst. Theory Appl.
  • 2020
This model may be used for two sided queueing applications such as ride sharing, web purchases, organ transplants, and for abandon at completion redundancy parallel service queues.

Stochastic non-bipartite matching models and order-independent loss queues

This paper proves that the Markov process associated with this model has the same transition diagram as in a product-form queueing model called an order-independent loss queue, which allows to adapt existing results on order- independent (loss) queues to stochastic matching models and derive closed-form expressions for several performance metrics that can be implemented using dynamic programming.

Redundancy Scheduling with Locally Stable Compatibility Graphs.

This work considers a scenario where jobs of various types are replicated to different subsets of servers as prescribed by a general compatibility graph, and exploits a product-form stationary distribution and weak local stability conditions to establish a state space collapse in heavy traffic.

A Survey of Stability Results for Redundancy Systems

A survey of recent results concerning the stability arguably the first benchmark of performance of systems with cancel-oncompletion redundancy is given and open questions and conjectures are pointed out.

Optimal Load Balancing with Locality Constraints

Under a "well-connected'' graph condition, it is shown that JFSQ and JFIQ are asymptotically optimal in the mean response time when the number of servers goes to infinity, and the well-connectedness condition can be satisfied by a random bipartite graph construction with relatively sparse connectivity.

Optimal Load Balancing in Bipartite Graphs

Under a "well-connected" graph condition, it is shown that JFSQ and JFIQ are asymptotically optimal in the mean response time when the number of servers goes to infinity, and the well-connectedness condition can be satisfied by a random bipartite graph construction with relatively sparse connectivity.

A survey on skill-based routing with applications to service operations management

This survey reviews works on skill-based routing in queues and summarizes key insights on routing/scheduling policies developed in the literature, and discusses complications brought by modern service operations management problems, particularly healthcare systems.

Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints

Surprisingly, when experiencing high demand, heavy-traffic universality of redundancy systems with assignment constraints can achieve a similar level of resource pooling and performance as a fully flexible system, even subject to quite strict task-server constraints.

References

SHOWING 1-10 OF 50 REFERENCES

A Skill Based Parallel Service System Under FCFS-ALIS — Steady State, Overloads, and Abandonments

An explicit product-form expression is derived for the stationary distribution of this queueing system when service capacity is sufficient and fluid limits of the system under overload are calculated to show that local steady state exists.

Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems

It is shown that a special version of QIR stochastically minimizes convex holding costs in a finite-horizon setting when the service rates are restricted to be pool dependent.

Matching queues with reneging: a product form solution

A parallel matching queue with reneging is studied and explicit product forms of the steady state distributions of this system are derived by identifying a partial balance condition.

Performance of Balanced Fairness in Resource Pools: A Recursive Approach

This paper presents a recursive approach to computing performance metrics like mean response times when the server capacities are shared according to balanced fairness, and introduces broad classes of pool structures that can be exactly analyzed in polynomial time.

Order independent loss queues

The OI loss queue thus extends previous loss models where customers are rejected when processing resources are not available and can be used to model blocking systems with simultaneous resource possession with the option of queueing blocked customers.

The Power of d Choices for Redundancy

A theoretical model of redundancy is proposed, the Redundancy-d system, in which each job sends redundant copies to d servers chosen uniformly at random, which derives the first exact expressions for mean response time in Redundancies-d systems with any finite number of servers.

Pass-and-swap queues

Pass-and-swap is introduced and it is demonstrated that closed networks of P&S queues can be applied to describe the dynamics of new and existing load-distribution and scheduling algorithms in machine pools.

A token-based central queue with order-independent service rates

A Unifying Token-Based Framework for Product-Form Queue Models that automates the very labor-intensive and therefore time-heavy and expensive process of designing and testing product-form queue models.

Dynamic Load Balancing with Tokens

  • Céline Comte
  • Computer Science
    2018 IFIP Networking Conference (IFIP Networking) and Workshops
  • 2018
This paper proposes a token-based mechanism that efficiently balances load between servers without requiring any knowledge on job arrival rates and server capacities and shows that the resulting dynamic load balancing is insensitive to the job size distribution.

FCFS Parallel Service Systems and Matching Models

The relations between these models are studied, and it is shown that they are closely related to the FCFS infinite bipartite matching model, in which two infinite sequences of customers and servers of several types are matched FCFS according to a bipartITE compatibility graph.