Title: Polling on a circle with non-uniform batch arrivals Show Chinese title

Title: 圆环上的非均匀成批到达轮询

Abstract: In this paper, we analyze a polling system on a circle with. Random batches of customers arrive at a circle, where each customer, independently, obtains a location according to a general distribution. A single server cyclically travels over the circle to serve all customers. We analyze the experienced delay of batches for two service policies: globally gated and exhaustive. The Laplace-Stieltjes transform of the experienced delay is found under the former policy. For the latter policy, we propose a mean-value analysis, resulting in an algorithmic approach for the evaluation of the mean experienced delay. Light- and heavy-traffic limits are derived exactly for the system performance. Show Chinese abstract

Abstract: 在本文中，我们分析了一个圆环上的轮询系统。 随机批次的顾客到达圆环，其中每个顾客独立地根据一种一般分布获得一个位置。 一个单一服务器在圆环上循环移动以服务所有顾客。 我们分析了两种服务策略下批次的体验延迟：全局门控和完全服务。 在前一种策略下，找到了体验延迟的拉普拉斯-斯蒂尔杰斯变换。 对于后一种策略，我们提出了一种均值分析，从而得到了评估平均体验延迟的算法方法。 精确推导了系统性能的轻载和重载极限。