Performance paradox of dynamic matching models under greedy policies
From MaRDI portal
Publication:6623436
DOI10.1007/S11134-024-09924-ZMaRDI QIDQ6623436
Fourneau Jean-Michel, Bušić Ana, Doncel Josu, Cadas Arnaud
Publication date: 24 October 2024
Published in: Queueing Systems (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Queueing with redundant requests: exact analysis
- Directed FCFS infinite bipartite matching
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Stability of the bipartite matching model
- Exact FCFS matching rates for two infinite multitype sequences
- Stability of the stochastic matching model
- Fcfs infinite bipartite matching of servers and customers
- Braess's paradox in a queueing network with state-dependent routing
- Braess's paradox in a loss network
- A product form for the general stochastic matching model
- A general stochastic matching model on multigraphs
- Stochastic non-bipartite matching models and order-independent loss queues
- Markov Chains and Dependability Theory
- Über ein Paradoxon aus der Verkehrsplanung
- A paradox of congestion in a queuing network
This page was built for publication: Performance paradox of dynamic matching models under greedy policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623436)
