Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-13T08:46:25.935Z Has data issue: false hasContentIssue false
  • English
  • Français

Stability of the Bipartite Matching Model

Part of: Graph theory Computer system organization Special processes Markov processes

Published online by Cambridge University Press:  22 February 2016

Ana Bušić ,
Varun Gupta  and
Jean Mairesse
Ana Bušić*
Affiliation:
INRIA and École Normale Supérieure
Varun Gupta*
Affiliation:
Carnegie Mellon University
Jean Mairesse*
Affiliation:
CNRS and University Paris Diderot
*
∗ Postal address: INRIA, 23 Avenue d'Italie, CS 81321, 75214 Paris Cedex 13, France. Email address: [email protected]
∗∗ Current address: Booth School of Business, University of Chicago, Chicago IL 60637, USA. Email address: [email protected]
∗∗∗ Postal address: University Paris Diderot, Sorbonne Paris Cité, LIAFA, UMR 7089 CNRS, Paris, France. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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

Markovian queueing theorystabilitybipartite matching

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 60K25: Queueing theory 68M20: Performance evaluation; queueing; scheduling 05C21: Flows in graphs
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 45 , Issue 2 , June 2013 , pp. 351 - 378
Copyright
© Applied Probability Trust 

References

Adan, I. and Weiss, G. (2012). Exact FCFS matching rates for two infinite multitype sequences. Operat. Res. 60, 475–489.CrossRefGoogle Scholar
Brémaud, P. (1999). Markov chains (Texts Appl. Math. 31). Springer, New York.CrossRefGoogle Scholar
Caldentey, R., Kaplan, E. H. and Weiss, G. (2009). FCFS infinite bipartite matching of servers and customers. Adv. Appl. Prob. 41, 695–730.CrossRefGoogle Scholar
Dai, J. and Prabhakar, B. (2000). The throughput of data switches with and without speedup. In Proc. INFOCOM 2000, Vol. 2, pp. 556–564.Google Scholar
Edmonds, J. and Karp, R. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19, 248–264.CrossRefGoogle Scholar
Ford, L. R. Jr. and Fulkerson, D. (1962). Flows in Networks. Princeton University Press.Google Scholar
Gans, N., Koole, G. and Mandelbaum, A. (2003). Telephone call centers: tutorial, review, and research prospects. Manufacturing Service Operat. Manag. 5, 79–141.CrossRefGoogle Scholar
McKeown, N. W., Mekkittikul, A., Anantharam, V. and Walrand, J. C. (1999). Achieving 100% throughput in an input-queued switch. IEEE Trans. Commun. 47, 1260–1267.Google Scholar
Seneta, E. (1981). Nonnegative Matrices and Markov Chains. Springer, New York.Google Scholar
Tassiulas, L. and Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automatic Control 37, 1936–1936.Google Scholar
Visschers, J., Adan, I. and Weiss, G. (2012). A product form solution to a system with a multi-type customers and multi-type servers. Queueing Systems 70, 269–298.CrossRefGoogle Scholar