arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.05960math.PR
收藏

具有重试和粘合期的轮询系统的性能分析

Performance analysis of polling systems with retrials and glue periods

Murtuza Ali Abidini, Onno Boxma, Bara Kim, Jeongsim Kim, Jacques Resing

摘要:

我们考虑有两个特殊功能的门控轮询系统:(i)重试,和(ii)胶水或保留期。当类型- $i$客户在站$i$的粘合期间到达或重试时,将在服务器对该站的下一次访问期间为其提供服务。在任何其他时间段到达站$i$的客户加入该站的轨道,并在指数分布时间后重试。这种轮询系统可用于研究光通信系统中某些开关的性能。对于指数分布的胶合期的情况下,我们提出了一种算法,以获得在每个站的客户数的时刻。对于一般分布的胶水期间,我们认为在系统中的总工作量的分布,使用它来推导出一个伪守恒律,这反过来又是用来获得准确的近似的个人平均等待时间。我们还考虑了在每个周期的总胶合期的约束下,选择胶合期的长度的问题,以最小化平均等待时间的加权和。

英文摘要:

We consider gated polling systems with two special features: (i) retrials, and (ii) glue or reservation periods. When a type-$i$ customer arrives, or retries, during a glue period of station $i$, it will be served in the next visit period of the server to that station. Customers arriving at station $i$ in any other period join the orbit of that station and retry after an exponentially distributed time. Such polling systems can be used to study the performance of certain switches in optical communication systems. For the case of exponentially distributed glue periods, we present an algorithm to obtain the moments of the number of customers in each station. For generally distributed glue periods, we consider the distribution of the total workload in the system, using it to derive a pseudo conservation law which in its turn is used to obtain accurate approximations of the individual mean waiting times. We also consider the problem of choosing the lengths of the glue periods, under a constraint on the total glue period per cycle, so as to minimize a weighted sum of the mean waiting times.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑