首页> 外文会议>Information Sciences and Systems, 2009. CISS 2009 >Scheduling weighted packets with deadlines over a fading channel
【24h】

Scheduling weighted packets with deadlines over a fading channel

机译:在衰落的信道上调度具有期限的加权数据包

获取原文

摘要

We consider scheduling weighted packets with time constraints over a fading channel. Packets arrive in an online manner. Each packet has a value and a hard deadline by which it should be sent. The fade state of the channel determines the throughput obtained per unit of time and the channel's quality may change over time. In this paper, we design both offline and online algorithms to maximize weighted throughput, which is defined as the total value of the packets sent by their respective deadlines. We first present polynomial-time exact offline algorithms for this problem. Then, we present online algorithms and their competitive analysis, as well as the lower bounds of competitive ratio. Our work is the first one addressing weighted throughput for this important problem in the areas of information theory and communication.
机译:我们考虑在衰落信道上调度具有时间限制的加权数据包。数据包以在线方式到达。每个数据包都有一个值和一个严格的截止日期,应在此之前发送该数据包。通道的淡入淡出状态决定了每单位时间获得的吞吐量,通道的质量可能会随时间变化。在本文中,我们同时设计了离线算法和在线算法,以最大化加权吞吐量,该加权吞吐量定义为按各自截止日期发送的数据包的总价值。我们首先提出针对该问题的多项式时间精确离线算法。然后,我们介绍了在线算法及其竞争分析,以及竞争比率的下限。我们的工作是针对信息理论和通信领域中这一重要问题的加权吞吐量的第一个研究。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号