Variable frame based Max-Weight algorithms for networks with switchover delay
Variable frame based Max-Weight algorithms for networks with switchover delay
复制标题
用于具有切换延迟的网络的基于可变帧的最大权重算法
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
E. Modiano
中科院分区：
文献类型：
--
作者：
G. Çelik;S. Borst;P. Whiting;E. Modiano
本文研究了具有干扰约束和时延约束的网络调度问题，其中每个服务的重新配置需要非零时间。切换延迟发生在许多电信应用中，诸如卫星、光学或延迟容忍网络（DTN）。在零时延下，最大权算法是吞吐量最优的，而不需要知道到达速率。然而，我们表明，当存在非零切换延迟时，Max-Weight的这一属性不再成立。我们提出了一类基于可变帧的最大权值（VFMW）算法，该算法采用最大权值调度对应的帧的开始在一个时间间隔的持续时间依赖于队列大小。的VFMW算法动态地适应帧大小的随机到来，并提供吞吐量最优，而不需要的到达率的知识。将VFMW算法应用于DTN和光网络的仿真结果表明，该算法具有良好的时延性能。
This paper considers the scheduling problem for networks with interference constraints and switchover delays, where it takes a nonzero time to reconfigure each service schedule. Switchover delay occurs in many telecommunication applications such as satellite, optical or delay tolerant networks (DTNs). Under zero switchover delay it is well known that the Max-Weight algorithm is throughput-optimal without requiring knowledge of the arrival rates. However, we show that this property of Max-Weight no longer holds when there is a nonzero switchover delay. We propose a class of variable frame based Max-Weight (VFMW) algorithms which employ the Max-Weight schedule corresponding to the beginning of the frame during an interval of duration dependent on the queue sizes. The VFMW algorithms dynamically adapt the frame sizes to the stochastic arrivals and provide throughput-optimality without requiring knowledge of the arrival rates. Numerical results regarding the application of the VFMW algorithms to DTN and optical networks demonstrate a good delay performance.