Batch sojourn time in polling systems on a circle
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915183399534592 |
|---|---|
| author | Engels, Tim Adan, Ivo Boxma, Onno Resing, Jacques |
| author_facet | Engels, Tim Adan, Ivo Boxma, Onno Resing, Jacques |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_12793 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Batch sojourn time in polling systems on a circle Engels, Tim Adan, Ivo Boxma, Onno Resing, Jacques Probability 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. |
| title | Batch sojourn time in polling systems on a circle |
| topic | Probability |
| url | https://arxiv.org/abs/2308.12793 |