References
- Adan, I.; Bušić, A.; Mairesse, J.; Weiss, G. Reversibility and further properties of FCFS infinite bipartite matching. Math. Oper. Res. 2018, 43, 598–621. DOI: https://doi.org/10.1287/moor.2017.0874.
- Adan, I.; Kleiner, I.; Righter, R.; Weiss, G. FCFS parallel service systems and matching models. Perform. Eval. 2018, 127-128, 253–272. DOI: https://doi.org/10.1016/j.peva.2018.10.005.
- Adan, I.; Weiss, G. Exact FCFS matching rates for two infinite multitype sequences. Oper. Res. 2012, 60, 475–489. DOI: https://doi.org/10.1287/opre.1110.1027.
- Begeot, J.; Marcovici, I.; Moyal, P.; Rahme, Y. A general stochastic matching model on multigraphs. arXiv:2011.05169 [math], 2020.
- Berezner, S. A.; Kriel, C. F.; Krzesinski, A. E. Quasi-reversible multiclass queues with order independent departure rates. Queue. Syst. 1995, 19, 345–359. DOI: https://doi.org/10.1007/BF01151928.
- Berezner, S. A.; Krzesinski, A. E. Order independent loss queues. Queue. Syst. 1996, 23, 331–335. DOI: https://doi.org/10.1007/BF01206565.
- Bonald, T.; Comte, C. Balanced fair resource sharing in computer clusters. Perform. Eval. 2017, 116, 70–83. DOI: https://doi.org/10.1016/j.peva.2017.08.006.
- Bonald, T.; Comte, C.; Shah, V.; de Veciana, G. Poly-symmetry in processor-sharing systems. Queue. Syst. 2017, 86, 327–359. DOI: https://doi.org/10.1007/s11134-017-9525-2.
- Bušić, A.; Gupta, V.; Mairesse, J. Stability of the bipartite matching model. Adv. Appl. Probab. 2013, 45, 351–378. DOI: https://doi.org/10.1239/aap/1370870122.
- Cadas, A.; Doncel, J.; Fourneau, J.-M.; Bušić, A. Flexibility can hurt dynamic matching system performance. arXiv:2009.10009 [cs, math], 2020.
- Caldentey, R.; Kaplan, E. H.; Weiss, G. FCFS Infinite Bipartite Matching of Servers and Customers. Adv. Appl. Probab. 2009, 41, 695–730. DOI: https://doi.org/10.1239/aap/1253281061.
- Cardinaels, E.; Borst, S.; van Leeuwaarden, J. S. H. Heavy-traffic universality of redundancy systems with data locality constraints. arXiv:2005.14566 [math], 2021.
- Chao, X. Networks with customers, signals, and product form solution. In Queueing Networks: A Fundamental Approach, International Series in Operations Research & Management Science; R. J. Boucherie and N. M. van Dijk, Eds.; Springer: US, 2011; 217–267.
- Comte, C. Resource management in computer clusters: algorithm design and performance analysis. PhD thesis, Institut Polytechnique de Paris, 2019.
- Feller, W. An Introduction to Probability Theory and Its Applications, Volume 2; John Wiley & Sons, Inc., 1966, 826 pp.
- Gardner, K.; Righter, R. Product forms for FCFS queueing models with arbitrary server-job compatibilities: An overview. Queue. Syst. 2020, 96, 3–51. DOI: https://doi.org/10.1007/s11134-020-09668-6.
- Keilson, J.; Servi, L. D. A distributional form of little’s law. Oper. Res. Lett. 1988, 7, 223–227. DOI: https://doi.org/10.1016/0167-6377(88)90035-1.
- Kelly, F. P. Reversibility and Stochastic Networks; Cambridge University Press: New York, NY, USA, 2011.
- Louth, G.; Mitzenmacher, M.; Kelly, F. Computational complexity of loss networks. Theor. Comput. Sci. 1994, 125, 45–59. DOI: https://doi.org/10.1016/0304-3975(94)90293-3.
- Mairesse, J.; Moyal, P. Stability of the stochastic matching model. J. Appl. Probab. 2016, 53, 1064–1077. DOI: https://doi.org/10.1017/jpr.2016.65.
- Moyal, P.; Bušić, A.; Mairesse, J. A product form for the general stochastic matching model. J. Appl. Probab. 2021, 58, 449–468. DOI: https://doi.org/10.1017/jpr.2020.100.
- Shah, V.; de Veciana, G. High-performance centralized content delivery infrastructure: Models and asymptotics. IEEE/ACM Trans. Netw. 2015, 23, 1674–1687. DOI: https://doi.org/10.1109/TNET.2015.2461132.
- Thi, T. H. D.; Fourneau, J.; Tran, M. A. Networks of order independent queues with signals. In 2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems; 2013, 131–140.