TY - UNPB
T1 - Batch sojourn time in polling systems on a circle
AU - Engels, Tim
AU - Adan, Ivo
AU - Boxma, Onno
AU - Resing, Jacques
PY - 2023/8/24
Y1 - 2023/8/24
N2 - In this paper, we analyze a polling system on a circle. Random batches of customers arrive at a circle, where each customer, independently, obtains a uniform location. A single server cyclically travels over the circle to serve all customers. Using mean value analysis, we derive the expected number of waiting customers within a given distance of the server and a closed form expression for the mean batch sojourn time.
AB - In this paper, we analyze a polling system on a circle. Random batches of customers arrive at a circle, where each customer, independently, obtains a uniform location. A single server cyclically travels over the circle to serve all customers. Using mean value analysis, we derive the expected number of waiting customers within a given distance of the server and a closed form expression for the mean batch sojourn time.
KW - math.PR
U2 - 10.48550/arXiv.2308.12793
DO - 10.48550/arXiv.2308.12793
M3 - Preprint
VL - 2308.12793
SP - 1
EP - 16
BT - Batch sojourn time in polling systems on a circle
PB - arXiv.org
ER -