Chronicles of jockeying in queuing systems (2402.11061v4)
Abstract: Trends in communication systems suggest gradual adjustments in the infrastructural landscape and application ecosystem. The dynamics arising from these changes, plus the expected service level requirements, present more challenges with regard to packet transmission, task offloading and impatient queueing. Generally, there are two types of common impatient queuing behavior that have been well studied, namely balking and reneging. In this survey, we are interested in the third type of impatience: jockeying, a phenomenon that draws origins from impatient customers switching from one queue to another. The problem is that there exists a plethora of literature that theoretically models for such impatience and all studies are diverse in the methodologies used. This raises questions about the practicality of some concepts from impatient queueing in dynamic environments. This survey chronicles those findings whose use case coverage includes information and communication systems, especially Multi-Access Edge Computing. We comparatively summarize the reviewed literature regarding the methodologies, invoked models and use cases. Furthermore, we discuss recently emerging paradigms and opens issues that are worth deeper study. This discussion is guided by the argument that the expected architectural transformations in these systems bring into question the applicability of existing impatience modeling schemes.
- Matrix-geometric analysis of the shortest queue problem with threshold jockeying. Operations Research Letters 13 (03 1993), 107–112. https://doi.org/10.1016/0167-6377(93)90037-H
- Analysis of the Asymmetric Shortest Queue Problem. Queueing Syst. Theory Appl. 8, 1 (2 1991), 1–58. https://doi.org/10.1007/BF02412240
- Analysis of the asymmetric shortest queue problem with threshold jockeying. Communications in Statistics. Stochastic Models 7, 4 (1991), 615–627. https://doi.org/10.1080/15326349108807209
- Analysis of the symmetric shortest queue problem. Communications in Statistics. Part C, Stochastic Models 6 (1990), 691–713. https://doi.org/10.1080/15326349908807169
- Erlang Agner Krarup. 1909. Sandsynlighedsregning og Telefonsamtaler. Nyt tidsskrift for matematik 20 (1909), 33–39. http://www.jstor.org/stable/24528622
- Clinton J. Ancker and A. V. Gafarian. 1963. Some Queuing Problems with Balking and Reneging. I. Operations Research 11, 1 (1963), 88–100. http://www.jstor.org/stable/168146
- D. Y. Barrer. 1959. Queues, Inventories and Maintenance (Philip M. Morse). SIAM Rev. 1, 2 (1959), 186–187. https://doi.org/10.1137/1001042
- Brian W. Conolly. 1984. “The Autostrada Queueing Problem.” Journal of Applied Probability. JSTOR 21, no. 2 (1984), 394–403. https://doi.org/10.2307/3213648
- Jim G. Dai. 1995. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models. The Annals of Applied Probability 5, 1 (1995), 49–77. http://www.jstor.org/stable/2245268
- Jim G. Dai. 1996. A fluid limit model criterion for instability of multiclass queueing networks. The Annals of Applied Probability 6, 3 (1996), 751 – 757. https://doi.org/10.1214/aoap/1034968225
- Jim G. Dai and Sean P. Meyn. 1995. Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Automat. Control 40, 11 (1995), 1889–1904. https://doi.org/10.1109/9.471210
- Strategic dynamic jockeying between two parallel queues. Probability in the Engineering and Informational Sciences 30, 1 (2016), 41–60. https://doi.org/10.1017/S0269964815000273
- Rosario Delgado and Evsey Morozov. 2014a. Stability analysis of cascade networks via fluid models. Performance Evaluation 82 (2014), 39–54. https://doi.org/10.1016/j.peva.2014.10.001
- Rosario Delgado and Evsey V. Morozov. 2014b. Stability Analysis of Some Networks with Interacting Servers. International Conference on Analytical and Stochastic Modeling Techniques and Applications ASMTA 2014 (2014), 1–15. https://doi.org/10.1007/978-3-319-08219-6_1
- William E. DISNEY, Ralph L; MITCHELL. 1970. A Solution for Queues with Instantaneous Jockeying and Other Customer Selection Rules. Naval Research Logistics 17 (9 1970), 315–325. https://doi.org/10.1002/nav.3800170308
- Douglas G. Down and Mark E. Lewis. 2006. Dynamic load balancing in parallel queueing systems: Stability and optimal control. European Journal of Operational Research 168, 2 (2006), 509–519. https://doi.org/10.1016/j.ejor.2004.04.041 Feature Cluster on Mathematical Finance and Risk Management.
- Elsayed A. Elsayed and Ali S. Bastani. 1985. General solutions of the jockeying problem. European Journal of Operational Research 22, 3 (1985), 387–396. https://doi.org/10.1016/0377-2217(85)90258-9
- Bi-objective optimization approach to a multi-layer location–allocation problem with jockeying. Computers & Industrial Engineering 149 (2020), 106740. https://doi.org/10.1016/j.cie.2020.106740
- Robert D. Foley and David R. McDonald. 2001. Join the Shortest Queue: Stability and Exact Asymptotics. The Annals of Applied Probability 11, 3 (2001), 569–607. http://www.jstor.org/stable/2699873
- Ilya B. Gertsbakh. 1984. The shorter queue problem: A numerical study using the matrix-geometric solution. European Journal of Operational Research 15 (1984), 374–381.
- Fablenne Gillent and Guy Latouche. 1983. Semi-explicit solutions for M/PH/1-like queuing systems. European Journal of Operational Research 13, 2 (1983), 151–160. https://doi.org/10.1016/0377-2217(83)90077-2
- Harold Gumbel. 1960. Waiting Lines with Heterogeneous Servers. Operations Research 8, 4 (1960), 504–511. http://www.jstor.org/stable/167292
- Frank A. Haight. 1958. Two Queues in Parallel. Biometrika 45, 3/4 (1958), 401–410. http://www.jstor.org/stable/2333187
- Frank A. Haight. 1960. Queuing with Balking. II. Biometrika 47, 3/4 (1960), 285–296. http://www.jstor.org/stable/2333300
- Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics. Applied Mathematical Modelling 40 (2016), 4948–4969.
- Impatient Queuing for Intelligent Task Offloading in Multi-Access Edge Computing. IEEE Transactions on Wireless Communications PP (01 2022), 1–1. https://doi.org/10.1109/TWC.2022.3191287
- Sufficient conditions for a geometric tail in a QBD process with many countable levels and phases. Stochastic Models 21, 1 (2005), 77–99. https://doi.org/10.1081/STM-200046489
- Refael Hassin and Moshe Haviv. 1994. Equilibrium strategies and the value of information in a two line queuing system with threshold jockeying. Stochastic Models - STOCH MODELS 10 (01 1994), 415–435. https://doi.org/10.1080/15326349408807302
- Qiming He and Marcel F. Neuts. 2002. Two M/M/1 Queues with Transfers of Customers. Queueing Systems 42 (2002), 377–400.
- Tao Jiang and Li-Wei Liu. 2016. Tail Asymptotics of Two Parallel Queues with Transfers of Customers. Journal of the Operations Research Society of China 4 (04 2016). https://doi.org/10.1007/s40305-016-0127-1
- Optimality of the last-in-first-out (LIFO) service discipline in queuing systems with real-time constraints. Proceedings of the 28th IEEE Conference on Decision and Control, 2, 0 (1989), 1073–1074. https://doi.org/10.1109/CDC.1989.70296
- Edward P.C. Kao and Chiunsin Lin. 1990. A matrix-geometric solution of the jockeying problem. European Journal of Operational Research 44, 1 (1990), 67–74. https://doi.org/10.1016/0377-2217(90)90315-3
- David G. Kendall. 1953. Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain. The Annals of Mathematical Statistics 24, 3 (1953), 338–354. http://www.jstor.org/stable/2236285
- John Frank C. Kingman. 1961. Two Similar Queues in Parallel. The Annals of Mathematical Statistics 32, 4 (1961), 1314–1323. http://www.jstor.org/stable/2237929
- John Frank C. Kingman. 1962. On queues in which customers are served in random order. Mathematical Proceedings of the Cambridge Philosophical Society 58 (1962), 79 – 91.
- Ernest Koenigsberg. 1966. On Jockeying in Queues. Management Science 12 (1966), 412–436.
- Ger Koole. 1996. On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers. Mathematics of Operations Research 21, 2 (1996), 469–476. http://www.jstor.org/stable/3690243
- Guy Latouche and V. Ramaswami. 1987. Introduction to Matrix Analytic Methods in Stochastic Modelling. Society for Industrial and Applied Mathematics, Philadelphia.
- Vlada Limic. 2001. A LIFO Queue in Heavy Traffic. The Annals of Applied Probability 11, 2 (2001), 301–331. http://www.jstor.org/stable/2667250
- Optimal Policy for Controlling Two-Server Queueing Systems with Jockeying. Journal of Systems Engineering and Electronics 33, 1 (2022), 144–155. https://doi.org/10.23919/JSEE.2022.000015
- Andrey Andreyevich Markov. 1906. Extension of the law of large numbers to quantities dependent of each other [Rasprostraneniye zakona bolshikh chisel na velichiny, zavisyashchiye drug ot druga]. Izvestiya fiziko-matematicheskogo obshchestva pri Kazanskom universitete [Proceedings of Physical and Mathematical Society at the University of Kazan] 2, 15 (1906), 135–156.
- Simon P. Martin and Isi Mitrani. 2008. Analysis of job transfer policies in systems with unreliable servers. Annals of Operations Research 162 (2008), 127–141.
- Sean P. Meyn and Richard L. Tweedie. 1993. Stability of Markovian Processes III: Foster-Lyapunov Criteria for Continuous-Time Processes. Advances in Applied Probability 25, 3 (1993), 518–548. http://www.jstor.org/stable/1427522
- Ronald E. Mickens. 2015. Difference Equations: Theory, Applications and Advanced Topics. Vol. Third Edition. Chapman and Hall/CRC., London. https://doi.org/10.1201/b18186
- Masakiyo Miyazawa and Yiqiang Q. Zhao. 2004. The Stationary Tail Asymptotics in the GI/G/1-Type Queue with Countably Many Background States. Advances in Applied Probability 36, 4 (2004), 1231–1251. http://www.jstor.org/stable/4140396
- Marcel F. Neuts. 1986. The caudal characteristic curve of queues. Advances in Applied Probability 18, 1 (1986), 221–254. https://doi.org/10.2307/1427244
- Marcel Fernand Neuts. 1994. Matrix-geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover Publications, Newyork. https://books.google.de/books?id=WPol7RVptz0C
- S.D. Poisson and S.D. Poisson. 1837. Recherches sur la probabilité des jugements en matière criminelle et en matière civile: précédées des règles générales du calcul des probabilités. Bachelier, online. https://books.google.de/books?id=_8FAjzHfzHgC
- Martin L. Puterman. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1st ed.). John Wiley and Sons, Inc., USA.
- V. Ramswami and Guy Latouche. 1986. A general class of Markov processes with explicit matrix-geometric solutions. Operations-Research-Spektrum 8 (1986), 209–218.
- Rachel Ravid. 2021. A new look on the shortest queue system with jockeying. Probability in the Engineering and Informational Sciences 35, 3 (2021), 557–564. https://doi.org/10.1017/S0269964819000469
- A congested capacitated multi-level fuzzy facility location problem: An efficient drone delivery system. Computers & Operations Research 108 (2019), 57–68. https://doi.org/10.1016/j.cor.2019.04.001
- Wolfgang Stadje. 2009. A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying. Communications in Statistics - Theory and Methods 38:16-17 (2009), 3158–3169. https://doi.org/10.1080/03610920902947618
- Ahmed M.K. Tarabia. 2009. Transient analysis of two queues in parallel with jockeying. Stochastics 81, 2 (2009), 129–145. https://doi.org/10.1080/17442500802200658
- Ahmed M. K. Tarabia. 2008. Analysis of two queues in parallel with jockeying and restricted capacities. Applied Mathematical Modelling 32 (2008), 802–810.
- J. W. J. Williams. 1964a. Algorithm 232 - Heapsort. Communications of ACM 7, 6 (6 1964), 347–348. https://doi.org/10.1145/512274.512284
- J. W. J. Williams. 1964b. Algorithm 245 - Treesort. Communications of ACM 7, 12 (12 1964), 701. https://doi.org/10.1145/355588.365103
- Susan H. Xu and Y. Quennel Zhao. 1996. Dynamic routing and jockeying controls in a two-station queuing system. Advances in Applied Probability 28, 4 (1996), 1201–1226. https://doi.org/10.2307/1428170
- Y. Zhao and Grassmann K. Winfried. 1995. Queuing Analysis of a Jockeying Model. Operations Research 43, 3 (1995), 520–529. http://www.jstor.org/stable/171875
- Yiqiang Q. Zhao and Winfried K. Grassmann. 1990. The shortest queue model with jockeying. Naval Research Logistics 37 (1990), 773–787.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.