论文标题
有损投票系统的公平机会性调度程序
Fair opportunistic schedulers for Lossy Polling systems
论文作者
论文摘要
具有损失的投票系统是有用的数学对象，可以对许多实用的系统进行建模，例如旅行推销员问题，并带有经常性请求。在这种系统中，研究较少但重要的方面之一是单个站点得出的公用事业的差异。此外，旅行条件的随机波动可能会对性能产生重大影响。这要求提供一个适应公平方面的调度程序，这取决于旅行条件和动态系统状态。 受到无线网络的广义Alpha-Fair调度程序的启发，我们提出了一个调度仪家庭，以进一步考虑旅行条件的二元知识。这些调度程序是机会主义的，只有当车站积累了太少的公用事业时，将服务器分配到一个不良旅行条件的站点。我们说明，随着公平性因素的增加，各个公用事业之间的差异减少到零，并且随着电台数量的增加，公平性的价格下降。
Polling systems with losses are useful mathematical objects that can model many practical systems like travelling salesman problem with recurrent requests. One of the less studied yet an important aspect in such systems is the disparity in the utilities derived by the individual stations. Further, the random fluctuations of the travel conditions can have significant impact on the performance. This calls for a scheduler that caters to the fairness aspect, depends upon the travel conditions and the dynamic system state. Inspired by the generalized alpha-fair schedulers of wireless networks, we propose a family of schedulers that further considers binary knowledge of the travel conditions. These schedulers are opportunistic, allocate the server to a station with bad travel condition only when the station has accumulated too little a utility by the decision epoch. We illustrate that the disparities among the individual utilities diminish to zero, as fairness factor increases, and further that the price of fairness decreases as the number of stations increase.
