Spatial Queues with Nearest Neighbour Shifts (2402.13192v2)
Abstract: This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide whether to join the queue they arrived at, or shift to one of the nearest neighbours. Such shifting strategies affect the load on the servers, and may cause some of the servers to become overloaded. We derive a law of large numbers and a central limit theorem for the fraction of overloaded servers in the system as the total number of servers $N \to \infty$. Additionally, in the one-dimensional case ($d=1$), we evaluate the expected fraction of overloaded servers for any finite $N$. Numerical experiments are provided to support our theoretical results. Typical applications of the results include electric vehicles queueing at charging stations, and queues in airports or supermarkets.
- E. Altman and H. Levy. Queueing in space. Advances in Applied Probability, 26(4):1095–1116, 1994.
- Stochastic geometry planning of electric vehicles charging stations. In Proc. International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 3062–3066, May 2020.
- S. Bahadır and E. Ceyhan. On the number of reflexive and shared nearest neighbor pairs in one-dimensional uniform data. arXiv preprint arXiv:1605.01940, 2016.
- S. Bahadır and E. Ceyhan. On the number of weakly connected subdigraphs in random kNN digraphs. Discrete & Computational Geometry, 65(1):116–142, 2021.
- J. Cuzick and R. Edwards. Spatial clustering for inhomogeneous populations. Journal of the Royal Statistical Society Series B: Statistical Methodology, 52(1):73–96, 1990.
- Order statistics. John Wiley & Sons, 2004.
- Electric vehicle charging point placement optimisation by exploiting spatial statistics and maximal coverage location models. Transportation Research Part D: Transport and Environment, 67:77–88, Feb. 2019.
- Analysis of a queuing system with possibility of waiting customers jockeying between two groups of servers. Mathematics, 11(6):1475, Jan. 2023.
- On nearest-neighbor graphs. Discrete & Computational Geometry, 17:263–282, 1997.
- V. Kavitha and E. Altman. Queuing in space: Design of message ferry routes in static ad hoc networks. In 2009 21st International Teletraffic Congress, pages 1–8, Sept. 2009.
- E. Koenigsberg. On jockeying in queues. Management Science, Jan. 1966.
- L. Leskelä and F. Unger. Stability of a spatial polling system with greedy myopic service. Annals of Operations Research, 198:165–183, 2012.
- Optimal policy for controlling two-server queueing systems with jockeying. Journal of Systems Engineering and Electronics, 33(1):144–155, Feb. 2022.
- Nearest neighbors and Voronoi regions in certain point processes. Advances in Applied Probability, 15(4):726–751, 1983.
- C. Ren and Y. Hou. A novel evaluation method of electric vehicles charging network based on stochastic geometry. Oct. 2020. Pages: 468.
- L. T. Rolla and V. Sidoravicius. Stability of the greedy algorithm on the circle. Communications on Pure and Applied Mathematics, 70(10):1961–1986, 2017.
- S. Ross. A first course in probability. Pearson, 2010.
- Greedy servers on a torus. In Proceedings of the 2011 Winter Simulation Conference (WSC), pages 369–380, Dec. 2011.
- G. D. Çelik and E. Modiano. Dynamic vehicle routing for data gathering in wireless networks. In 49th IEEE Conference on Decision and Control (CDC), pages 2372–2377, Dec. 2010.