Showing math.PRShow all
2 papers · 1 filter
math.PR2026
Using memory to control admission to unobservable queues
Refael Hassin, Liron Ravner
We study admission control to an unobservable M/M/1 queue. A memoryless controller can only randomly thin arrivals (random routing, RR). We show that a gated admission (GA) policy,…
math.PR2025
Uncovering the topology of an infinite-server queueing network from population data
Hritika Gupta, Michel Mandjes, Liron Ravner +1
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters per…