A Token-Based Central Queue with Order-Independent Service Rates

References

• Adan IJBF, Weiss G (2014) A skill based parallel service system under FCFS-ALIS: steady state, overloads, and abandonments. Stochastic Systems 4(1):250–299.Link, Google Scholar
• Adan IJBF, Hurkens C, Weiss G (2010) A reversible Erlang loss system with multitype customers and multitype servers. Probab. Engrg. Informational Sci. 24(4):535–548.Crossref, Google Scholar
• Adan IJBF, Righter R, Weiss G (2017) FCFS parallel service systems and matching models. Proc. 11th EAI Internat. Conf. Performance Evaluation Methodologies Tools (Valuetools) (ACM, New York), 106–112.Google Scholar
• Adan IJBF, Busic A, Mairesse J, Weiss G (2018a) Reversibility and further properties of FCFS infinite bipartite matching. Math. Oper. Res. 43(2):598–621.Link, Google Scholar
• Adan IJBF, Kleiner I, Righter R, Weiss G (2018b) FCFS parallel service systems and matching models. Performance Evaluation 127–128:253–272.Crossref, Google Scholar
• Ayesta U, Bodas T, Verloop IM (2018) On a unifying product form framework for redundancy models. Performance Evaluation 127–128:93–119.Crossref, Google Scholar
• Baskett F, Chandy KM, Muntz RR, Palacios FG (1975) Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2):248–260.Crossref, Google Scholar
• Bonald T, Comte C (2017) Balanced fair resource sharing in computer clusters. Performance Evaluation 116:70–83.Crossref, Google Scholar
• Chao X (2011) Networks with customers, signals, and product form solutions. Boucherie RJ, Van Dijk NM, eds. Queueing Networks (Springer, New York), 217–268.Crossref, Google Scholar
• Comte C (2018) Dynamic load balancing with tokens. Proc. 17th Internat. IFIP TC6 Networking Conf. (IEEE, Piscataway, NJ), 343–351.Crossref, Google Scholar
• Comte C (2019) Dynamic load balancing with tokens. Comput. Comm. 144:76–88.Crossref, Google Scholar
• Crosby S, Krzesinski AE (1990) Product from solutions for multiserver centres with concurrent classes of customers. Performance Evaluation 11(4):265–281.Crossref, Google Scholar
• Foster FG (1953) On the stochastic matrices associated with certain queuing processes. Ann. Math. Statist. 24(3):355–360.Crossref, Google Scholar
• Gardner K, Harchol-Balter M, Scheller-Wolf A, Velednitsky M, Zbarsky S (2017) Redundancy-d: The power of d choices for redundancy. Oper. Res. 65(4):1078–1094.Link, Google Scholar
• Gardner K, Zbarsky S, Doroudi S, Harchol-Balter M, Hyytiä E, Scheller-Wolf A (2016) Queueing with redundant requests: exact analysis. Queueing Systems 83(3–4):227–259.Crossref, Google Scholar
• Gumbel H (1960) Waiting lines with heterogeneous servers. Oper. Res. 8(4):504–511.Link, Google Scholar
• Jackson J (1957) Networks of waiting lines. Oper. Res. 5:516–523.Link, Google Scholar
• Keilson J, Servi LD (1990) The distributional form of Little’s law and the Fuhrmann-Cooper decomposition. Oper. Res. Lett. 9:239–247.Crossref, Google Scholar
• Kelly FP (1979) Stochastic Networks and Reversibility (Wiley, Chichester, UK).Google Scholar
• Krzesinski AE (2011) Order independent queues. Boucherie RJ, Van Dijk NM, eds., Queueing Networks (Springer, New York), 85–120.Crossref, Google Scholar
• Le Boudec J (1986) A BCMP extension to multiserver stations with concurrent classes of customers. Proc. ACM SIGMETRICS (ACM, New York), 78–91.Google Scholar
• Visschers J, Adan IJBF, Weiss G (2012) A product form solution to a system with multi-type jobs and multi-type servers. Queueing Systems 70(3):269–298.Crossref, Google Scholar