Delay-constrained scheduling: power efficiency, filter design, and bounds
Delay-constrained scheduling: power efficiency, filter design, and bounds
复制标题
DOI：
10.1109/infcom.2004.1354603
复制
发表时间：
2004-03
期刊：
影响因子：
--
通讯作者：
M. Khojastepour;A. Sabharwal
中科院分区：
文献类型：
--
作者：
M. Khojastepour;A. Sabharwal
以最小化高斯信道上的平均发射功率为目标，研究了具有最大时延约束的分组调度问题。主要的重点是获得不依赖于源到达过程的知识的稳健调度器。为此，我们首先证明了保证每个分组的最大排队延迟的所有调度器(健壮性或非稳健性)等价于时变线性过滤器。利用滤波和调度之间的联系，我们研究了最优功率最小化鲁棒调度器的设计。在过滤连接的激励下，对两个案例进行了详细研究。首先，提出了一种时不变的鲁棒调度器，并对其性能进行了完整的刻画。其次，我们提出了最优时变鲁棒调度器，并证明了它具有非常直观的时间充水结构。我们还给出了功率最小化调度器性能的上下界作为延迟约束的函数。新的结果形成了理解物理层功率度量和网络层延迟度量之间的分组时间尺度相互作用的重要一步
In this paper, packet scheduling with maximum delay constraints is considered with the objective to minimize average transmit power over Gaussian channels. The main emphasis is on deriving robust schedulers which do not rely on the knowledge of the source arrival process. Towards that end, we first show that all schedulers (robust or otherwise) which guarantee a maximum queuing delay for each packet are equivalent to a time-varying linear filter. Using the connection between filtering and scheduling, we study the design of optimal power minimizing robust schedulers. Two cases, motivated by filtering connection, are studied in detail. First, a time-invariant robust scheduler is presented and its performance is completely characterized. Second, we present the optimal time-varying robust scheduler, and show that it has a very intuitive time water-filling structure. We also present upper and lower bounds on the performance of power-minimizing schedulers as a function of delay constraints. The new results form an important step towards understanding of the packet time-scale interactions between physical layer metric of power and network layer metric of delay