arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.04557math.PR
收藏

使用强制空闲时间提高轮询模型的性能

Improving the performance of polling models using forced idle times

Frank Aurzada, Sebastian Schwinn

摘要:

我们在Takagi(MIT Press,1986)的意义上考虑投票模型。在我们的例子中,服务器的特性是它可能被迫在空队列中空闲地等待新消息,而不是切换到下一站。我们提出了四种不同的观望策略来管理这些等待期。我们假设泊松到达的新消息,并允许一般服务和实时分布。结果是平均平均等待延迟的公式和表征的情况下,观望策略产生一个较低的延迟相比,穷举策略。

英文摘要:

We consider polling models in the sense of Takagi (MIT Press, 1986). In our case, the feature of the server is that it may be forced to wait idly for new messages at an empty queue instead of switching to the next station. We propose four different wait-and-see strategies that govern these waiting periods. We assume Poisson arrivals for new messages and allow general service and switchover time distributions. The results are formulas for the mean average queueing delay and characterisations of the cases where the wait-and-see strategies yield a lower delay compared to the exhaustive strategy.

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

↑