首页> 外文会议>2011 IEEE International Symposium on Information Theory Proceedings >Variable frame based Max-Weight algorithms for networks with switchover delay
【24h】

Variable frame based Max-Weight algorithms for networks with switchover delay

机译:具有切换延迟的网络基于可变帧的最大权重算法

获取原文
获取外文期刊封面目录资料

摘要

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.
机译:本文考虑了具有干扰约束和切换延迟的网络的调度问题,在该问题上重新配置每个服务调度需要花费非零时间。切换延迟发生在许多电信应用中,例如卫星,光或延迟容忍网络(DTN)。在零切换延迟下,众所周知,最大权重算法是吞吐量最佳的,而无需知道到达速率。但是,我们表明,当切换延迟为非零时,Max-Weight的此属性不再成立。我们提出了一类基于可变帧的最大权重(VFMW)算法,该算法采用取决于队列大小的持续时间间隔内与帧开始相对应的最大权重计划。 VFMW算法动态地将帧大小调整为适合随机到达,并在不需要知道到达速率的情况下提供吞吐量优化。有关将VFMW算法应用于DTN和光网络的数值结果证明了良好的延迟性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号