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

  title={Stochastic non-bipartite matching models and order-independent loss queues},
  author={C{\'e}line Comte},
  journal={Stochastic Models},
  pages={1 - 36}
  • Céline Comte
  • Published 1 December 2020
  • Mathematics, Computer Science
  • Stochastic Models
Abstract The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several recent works incorporated time by considering a stochastic model in which items of different classes arrive according to independent Poisson processes and assignment constraints are described by an undirected non-bipartite graph on the classes. In… 

New frontiers for stochastic matching

In the modern peer-to-peer and collaborative economy, many applications offer their users an interface to interact and collaborate, and their time in the system is finalized to finding a match, identified as such according to fixed compatibility rules.

Perfect sampling of stochastic matching models with reneging

This paper introduces a slight variation of the Dominated Coupling From the Past algorithm (DCFTP) of Kendall, for bounded Markov chains, based on the control of a stochastic recursion by a (typically monotonic) one.

Stochastic dynamic matching: A mixed graph-theory and linear-algebra approach

This paper considers a matching problem in which items of different classes arrive according to independent Poisson processes, and introduces a mapping between the dimension of the solution set of this conservation equation, the structure of the compatibility graph, and the existence of a stable policy.

Stability regions of systems with compatibilities, and ubiquitous measures on graphs

This paper addresses the ubiquity of remarkable measures on graphs, and their applications. In many queueing systems, it is necessary to take into account the compatibility constraints between users,

Performance Evaluation of Stochastic Bipartite Matching Models

A new compact and manageable expression is derived for the normalization constant of this distribution, as well as for the waiting probability and mean waiting time of customers and servers, of a stochastic bipartite matching model consisting of multi-class customers and multiclass servers.



A product form for the general stochastic matching model

It is shown that the natural necessary condition of stability of the system is also sufficient for the natural ‘first-come, first-matched’ matching policy, and the stationary distribution under a remarkable product form is derived.

Stability of the stochastic matching model

The matching model is introduced and it is proved that the model may be stable if and only if the matching graph is nonbipartite.

Heavy-traffic universality of redundancy systems with data locality constraints. arXiv:2005.14566 [math], 2021

  • 2021

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 general stochastic matching model on multigraphs

We extend the general stochastic matching model on graphs introduced in (Mairesse and Moyal, 2016), to matching models on multigraphs, that is, graphs with self-loops. The evolution of the model can

Flexibility can Hurt Dynamic Matching System Performance

It is shown that such a model may exhibit a non intuitive behavior: increasing the matching flexibility by adding new edges in the matching graph may lead to a larger average population at the steady state, which can be viewed as an analog of the Braess paradox.

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

It is shown how, under an appropriate detailed description of the state, many existing product-form results are corollaries of similar results for the Order Independent queue, and how to use them to determine distributions for steady-state response times.

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.

Resource management in computer clusters : algorithm design and performance analysis. (Gestion des ressources dans les grappes d'ordinateurs : conception d'algorithmes et analyse de performance)

A scheduling algorithm that extends the principle of round-robin to a cluster where each incoming job is assigned to a pool of computers by which it can subsequently be processed in parallel and a load-balancing algorithm based on tokens for clusters where jobs have assignment constraints are proposed.

I and J