论文标题
通用策略跟踪：针对状态观察延迟的无线网络安排
Universal Policy Tracking: Scheduling for Wireless Networks with Delayed State Observation
论文作者
论文摘要
已经提出了许多调度算法来优化各种性能指标，例如无线网络中的吞吐量，延迟和实用程序。但是，这些算法通常需要即时访问网络状态信息，这并不总是可用。尽管有时可以通过延迟的状态信息来实现网络稳定性，但其他性能指标（例如延迟）可能会降低。因此，我们的目标不是简单地稳定系统，而是设计一个可以模仿任意调度算法的框架。一种天真的方法是直接通过延迟信息做出决策，但我们表明这种方法可能导致性能差。取而代之的是，我们提出了通用跟踪（UT）算法，该算法可以模仿观察延迟下的任意调度算法的作用。我们严格地表明，跟踪UT和计划算法之间的性能差距是由常数界的。我们的数值实验表明，在各种应用中，UT明显优于天真的方法。
Numerous scheduling algorithms have been proposed to optimize various performance metrics like throughput, delay and utility in wireless networks. However, these algorithms often require instantaneous access to network state information, which is not always available. While network stability can sometimes be achieved with delayed state information, other performance metrics such as latency may degrade. Thus, instead of simply stabilizing the system, our goal is to design a framework that can mimic arbitrary scheduling algorithms with performance guarantees. A naive approach is to make decisions directly with delayed information, but we show that such methods may lead to poor performance. Instead, we propose the Universal Tracking (UT) algorithm that can mimic the actions of arbitrary scheduling algorithms under observation delay. We rigorously show that the performance gap between UT and the scheduling algorithm being tracked is bounded by constants. Our numerical experiments show that UT significantly outperforms the naive approach in various applications.
