Spatial Queues with Nearest Neighbour Shifts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Spatial Queues with Nearest Neighbour Shifts

B R Vinay Kumar
  • Function : Author
  • PersonId : 1282091

Abstract

Motivated primarily by electric vehicles (EV) queueing at charging stations, in this work we study multiple server queues on a Euclidean space. We consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers or EV users arrive at the servers according to Poisson processes of intensity $\lambda$. However, they probabilistically decide whether to join the queue they arrived at, or move to one of the nearest neighbours. The strategy followed by the customers affects the load on the servers in the long run. In this paper, we are interested in characterizing the fraction of servers that bear a larger load as compared to when the users do not follow any strategy, i.e., they join the queue they arrive at. These are called \emph{overloaded servers}. We evaluate the expected fraction of overloaded servers in the system for the one dimensional case ($d=1$) when the users follow probabilistic nearest neighbour shift strategies.
Fichier principal
Vignette du fichier
IEEE_pdf_express_Xplore_converted.pdf (386.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04386596 , version 1 (10-01-2024)

Licence

Attribution

Identifiers

  • HAL Id : hal-04386596 , version 1

Cite

B R Vinay Kumar. Spatial Queues with Nearest Neighbour Shifts. ITC-35 - 35th International Teletraffic Congress : Networked Systems and Services, Oct 2023, Torino, Italy. ⟨hal-04386596⟩
11 View
7 Download

Share

Gmail Facebook X LinkedIn More