2000 character limit reached
Resource Allocation in Mobile Networks: A Decision Model Of Jockeying in Queues (2402.11054v3)
Published 16 Feb 2024 in cs.NI
Abstract: Use-case-specific network slicing in decentralized multi-tenancy cloud environments is a promising approach to bridge the gap between the demand and supply of resources in next-generation communication networks. Our findings associate different slice profiles to queues in a multi-server setting, such that tenants continuously assess their preferences and make rational decisions to minimize the queuing delay. Deviated from classical approaches that statistically model the jockeying phenomena in queuing systems, our work pioneers to setup a behavioral model of jockeying impatient tenants. This will serve as a basis for decentralized management of multi-queue systems, where the decision to jockey is individually made by each tenant upon its up-to-date assessment of expected waiting time. Additionally, we carry out numerical simulations to empirically unravel the parametric dependencies of the tenants' jockeying behavior.
- R. B. Sørensen, D. M. Kim, J. J. Nielsen, and P. Popovski, “Analysis of latency and mac-layer performance for class a lorawan,” IEEE Wireless Communications Letters, vol. 6, no. 5, pp. 566–569, 2017.
- M. Aloqaily, V. Balasubramanian, F. Zaman, I. Al Ridhawi, and Y. Jararweh, “Congestion mitigation in densely crowded environments for augmenting qos in vehicular clouds,” in Proceedings of the 8th ACM symposium on design and analysis of intelligent vehicular networks and applications, 2018, pp. 49–56.
- N. Aryal, E. Bertin, and N. Crespi, “Open radio access network challenges for next generation mobile network,” in 2023 26th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN), 2023, pp. 90–94.
- B. Han, V. Sciancalepore, Y. Xu, D. Feng, and H. D. Schotten, “Impatient queuing for intelligent task offloading in multi-access edge computing,” IEEE Transactions on Wireless Communications, 2022.
- W. Liu, R. Hu, R. Shinkuma, and T. Takahashi, “A fair resource sharing mechanism between mobile virtual network operators,” IEICE Transactions on Communications, vol. 98, no. 11, pp. 2141–2150, 2015.
- E. Hyytiä, T. Spyropoulos, and J. Ott, “Optimizing offloading strategies in mobile cloud computing,” Cryptanalyst, 2013.
- W. Jiang, B. Han, M. A. Habibi, and H. D. Schotten, “The road towards 6g: A comprehensive survey,” IEEE Open Journal of the Communications Society, vol. 2, pp. 334–366, 2021. [Online]. Available: https://doi.org/10.48550/arXiv.2102.01420
- S. Lall, A. S. Alfa, and B. T. Maharaj, “The role of queueing theory in the design and analysis of wireless sensor networks: An insight,” in 2016 IEEE 14th International Conference on Industrial Informatics (INDIN), 2016, pp. 1191–1194.
- A. H. e. a. Zakaria, “Performance analysis of mobile ad hoc networks using queuing theory.”   Springer Singapore, 2014, pp. 555–562.
- J. Razavilar, F. Rashid-Farrokhi, and K. R. Liu, “Traffic improvements in wireless communication networks using antenna arrays,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 3, pp. 458–471, 2000.
- B. Han, V. Sciancalepore, D. Feng, X. Costa-Perez, and H. D. Schotten, “A utility-driven multi-queue admission control solution for network slicing.”   IEEE, 2019, pp. 55–63.
- B. Han, V. Sciancalepore, X. Costa-Perez, D. Feng, and H. D. Schotten, “Multiservice-based network slicing orchestration with impatient tenants,” IEEE Transactions on Wireless Communications, vol. 19, no. 7, pp. 5010–5024, 2020.
- J. Prados-Garzon, P. Ameigeiras, J. J. Ramos-Munoz, J. Navarro-Ortiz, P. Andres-Maldonado, and J. M. Lopez-Soler, “Performance modeling of softwarized network services based on queuing theory with experimental validation,” IEEE Transactions on Mobile Computing, vol. 20, no. 4, pp. 1558–1573, 2021.
- J. Xin, Q. Zhu, G. Liang, and T. Zhang, “Performance analysis of d2d underlying cellular networks based on dynamic priority queuing model,” IEEE Access, vol. 7, pp. 27 479–27 489, 2019.
- D. Zinoviev, “Discrete event simulation. it’s easy with simpy,” PragPub, vol. 104, p. 1–16, 02 2018.
- B. S. Ucar I. and A. Azcorra, “simmer: Discrete-event simulation for r,” Journal of Statistical Software, vol. 90, 07 2019.
- R. I. Tinini, M. R. P. dos Santos, G. B. Figueiredo, and D. M. Batista, “5gpy: A simpy-based simulator for performance evaluations in 5g hybrid cloud-fog ran architectures,” Simulation Modelling Practice and Theory, vol. 101, p. 102030, 2020, modeling and Simulation of Fog Computing. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S1569190X19301613
- Z. A. Syed, S. Gummadi, E. L. Mahima, S. Reddy Naina, S. Eswaran, and P. Honnavalli, “Performance analysis of 5g network slicing simulations using simpy,” in 2022 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), 2022, pp. 1–6.
- P. J. Burke, “The output of a queuing system.” Operations Research, vol. 4, no. 6, pp. 699–704, 1956.
- M. J. M. P. B. M. Rao, “Algorithmic and approximation analyses of the shorter queue model,” Naval Research Logistics, vol. 34, pp. 381–398, 6 1987.
- D. G. Shimshak and G. P. Sphicas, “Waiting time in a two station series queueing system: The effect of dependent interarrival times,” The Journal of the Operational Research Society, vol. 33, no. 8, pp. 745–750, 1982. [Online]. Available: http://www.jstor.org/stable/2634322
- A. Dehghanian, J. P. Kharoufeh, and M. Modarres, “Strategic dynamic jockeying between two parallel queues,” Probability in the Engineering and Informational Sciences, vol. 30, no. 1, p. 41–60, 2016.
- E. A. Elsayed and A. S. Bastani, “General solutions of the jockeying problem,” European Journal of Operational Research, vol. 22, no. 3, pp. 387–396, 1985. [Online]. Available: https://www.sciencedirect.com/science/article/pii/0377221785902589
- A. Eshaghi Chaleshtori, H. Jahani, and A. Aghaie, “Bi-objective optimization approach to a multi-layer location–allocation problem with jockeying,” Computers & Industrial Engineering, vol. 149, p. 106740, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0360835220304605
- R. Ravid, “A new look on the shortest queue system with jockeying,” Probability in the Engineering and Informational Sciences, vol. 35, no. 3, p. 557–564, 2021.
- A. Tarabia, “Analysis of two queues in parallel with jockeying and restricted capacities,” Applied Mathematical Modelling, vol. 32, no. 5, pp. 802–810, 2008. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0307904X07000546
- Y. Zhao and G. K. Winfried, “Queuing analysis of a jockeying model,” Operations Research, vol. 43, no. 3, pp. 520–529, 1995. [Online]. Available: http://www.jstor.org/stable/171875
- E. Koenigsberg, “On jockeying in queues,” Management Science, vol. 12, pp. 412–436, 1966.
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.