Using memory to control admission to unobservable queues
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914623578439680 |
|---|---|
| author | Hassin, Refael Ravner, Liron |
| author_facet | Hassin, Refael Ravner, Liron |
| contents | 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, blocking arrivals for a fixed period after each admission, stochastically dominates RR at equal throughput, improving social welfare under any sojourn-based cost. We characterize the welfare-maximizing threshold and define the Price of Forgetting as the welfare ratio. This ratio is unbounded even though the absolute welfare gain stays uniformly bounded. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_02464 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Using memory to control admission to unobservable queues Hassin, Refael Ravner, Liron Probability 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, blocking arrivals for a fixed period after each admission, stochastically dominates RR at equal throughput, improving social welfare under any sojourn-based cost. We characterize the welfare-maximizing threshold and define the Price of Forgetting as the welfare ratio. This ratio is unbounded even though the absolute welfare gain stays uniformly bounded. |
| title | Using memory to control admission to unobservable queues |
| topic | Probability |
| url | https://arxiv.org/abs/2606.02464 |