• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Global Communications Conference >Distributed timely-throughput optimal scheduling for wireless networks
【24h】

Distributed timely-throughput optimal scheduling for wireless networks

机译：无线网络的分布式实时吞吐量优化调度

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Recent advance in distributed scheduling algorithms mainly focuses on designing CSMA-type protocols to achieve maximum network throughput in a fully distributive manner. However, it is inherently difficult for distributed scheduling algorithms to promise high throughput while maintaining low delay. To encounter this, a new scheduling algorithm, namely timely-throughput optimal algorithm, is introduced, which distributively determines the optimal transmission times for network users so that the largest set of traffic rates of network users can be supported, while ensuring timely data delivery within hard deadlines. More specifically, the maximum network capacity region that timely-throughput optimal scheduling algorithms can achieve is first derived, which characterizes the closure of the set of all arrival rate vectors under which there exists an viable scheduling algorithm to guarantee that all network users can meet the delay deadlines. Then, a distributed scheduling algorithm is proposed, which allows every user to make optimal transmission decision locally based on its incoming traffic rate, virtual debts, and previous channel sensing results. Finally, it is proven that the proposed algorithm is timely-throughput optimal in the sense that it can guarantee reliable data delivery before deadlines as long as the incoming traffic rates are within the derived maximum network capacity region.
机译：分布式调度算法的最新进展主要集中在设计CSMA类型的协议，以完全分布式的方式实现最大的网络吞吐量。然而，分布式调度算法固有地难以保证高吞吐量同时保持低延迟。为了解决这个问题，引入了一种新的调度算法，即及时吞吐量优化算法，该算法可以分布式确定网络用户的最佳传输时间，从而可以支持网络用户的最大流量集，同时确保在网络中及时传输数据。艰苦的最后期限。更具体地说，首先导出及时吞吐量最优调度算法可以实现的最大网络容量区域，该区域表征了所有到达速率向量集合的封闭，在该向量下，存在一种可行的调度算法来保证所有网络用户都可以满足延迟截止日期。然后，提出了一种分布式调度算法，该算法允许每个用户基于其传入流量，虚拟债务和先前的信道感知结果在本地做出最佳传输决策。最终，证明了所提算法是及时吞吐量最优的，从某种意义上说，只要传入流量速率在派生的最大网络容量范围内，就可以保证在截止日期之前可靠地进行数据传输。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号