论文标题
在排队系统中最大化非线性延迟敏感奖励
Towards Maximizing Nonlinear Delay Sensitive Rewards in Queuing Systems
论文作者
论文摘要
我们考虑在单个服务器队列中最大限度地提高长期平均奖励，在该服务器队列中获得的奖励是其周时间的非进攻功能。这项工作背后的动机来自多个应用程序，包括量子信息处理和多媒体流。我们介绍了一项新的服务学科，最短预测的Sojourn Time（SPST），在模拟中，它的表现比知名学科更好。我们还为这个高度复杂的问题提供了一些有限的分析保证。
We consider maximizing the long-term average reward in a single server queue, where the reward obtained for a job is a non-increasing function of its sojourn time. The motivation behind this work comes from multiple applications, including quantum information processing and multimedia streaming. We introduce a new service discipline, shortest predicted sojourn time (SPST), which, in simulations, performs better than well-known disciplines. We also present some limited analytical guarantees for this highly intricate problem.
