Stability of the Bipartite Matching Model
- 1 June 2013
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 45 (2), 351-378
- https://doi.org/10.1239/aap/1370870122
Abstract
We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles. There are finite sets C and S of customer and server classes, respectively. Time is discrete and at each time step one customer and one server arrive in the system according to a joint probability measure μ on C× S, independently of the past. Also, at each time step, pairs of matched customers and servers, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph (C, S, E⊂ C × S). A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete-time Markov chain. We study its stability under various admissible matching policies, including ML (match the longest), MS (match the shortest), FIFO (match the oldest), RANDOM (match uniformly), and PRIORITY. There exist natural necessary conditions for stability (independent of the matching policy) defining the maximal possible stability region. For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite graph. For the MS and PRIORITY policies, we exhibit a bipartite graph with a non-maximal stability region.Keywords
This publication has 9 references indexed in Scilit:
- Exact FCFS Matching Rates for Two Infinite Multitype SequencesOperations Research, 2012
- A product form solution to a system with multi-type jobs and multi-type serversQueueing Systems, 2012
- Fcfs infinite bipartite matching of servers and customersAdvances in Applied Probability, 2009
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- Achieving 100% throughput in an input-queued switchIEEE Transactions on Communications, 1999
- Markov ChainsPublished by Springer Science and Business Media LLC ,1999
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networksIEEE Transactions on Automatic Control, 1992
- Non-negative Matrices and Markov ChainsPublished by Springer Science and Business Media LLC ,1981
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972