Reversibility and Further Properties of FCFS Infinite Bipartite Matching

DOI10.1287/moor.2017.0874zbMath1433.60080arXiv1507.05939OpenAlexW1013271995MaRDI QIDQ5219556

Ana Bušić, Jean Mairesse, Gideon Weiss, Ivo J. B. F. Adan

Publication date: 12 March 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.05939

zbMATH Keywords

product formdynamic reversibilityinfinite bipartite matchingfirst come, first served policyLoynes' type construction

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards ⋮ Parallel multi-type many server conjecture ⋮ Fluid Models of Parallel Service Systems Under FCFS ⋮ A general stochastic matching model on multigraphs ⋮ STOCHASTIC MATCHING MODELS ⋮ Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ Many-server scaling of the N-system under FCFS-ALIS ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ On spatial matchings: The first-in-first-match case ⋮ Design heuristic for parallel many server systems ⋮ Matching queues with reneging: a product form solution ⋮ Directed FCFS infinite bipartite matching ⋮ Reward maximization in general dynamic matching systems ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs ⋮ Stochastic non-bipartite matching models and order-independent loss queues ⋮ On the Optimal Design of a Bipartite Matching Queueing System ⋮ A Token-Based Central Queue with Order-Independent Service Rates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A product form solution to a system with multi-type jobs and multi-type servers
• On the stability of a partially accessible multi-station queue with state-dependent routing
• Stability of the Bipartite Matching Model
• Exact FCFS Matching Rates for Two Infinite Multitype Sequences
• A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
• A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS
• Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
• Fcfs infinite bipartite matching of servers and customers
• A LOSS SYSTEM WITH SKILL-BASED SERVERS UNDER ASSIGN TO LONGEST IDLE SERVER POLICY
• Stochastic differential equations. An introduction with applications.

This page was built for publication: Reversibility and Further Properties of FCFS Infinite Bipartite Matching