Spatial queues with nearest neighbour shifts
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Authors
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Performance Evaluation, Volume 166
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→∞. 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.Description
Publisher Copyright: © 2024
Other note
Citation
Vinay Kumar, B R & Leskelä, L 2024, 'Spatial queues with nearest neighbour shifts', Performance Evaluation, vol. 166, 102448. https://doi.org/10.1016/j.peva.2024.102448