...
首页> 外文期刊>IEEE Transactions on Automatic Control >Dynamic Markov Decision Policies for Delay Constrained Wireless Scheduling
【24h】

Dynamic Markov Decision Policies for Delay Constrained Wireless Scheduling

机译:延迟受限无线调度的动态马尔可夫决策策略

获取原文
获取原文并翻译 | 示例
           

摘要

We consider a one-hop wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm that reacts to time varying channels and maximizes throughput utility (to within a desired proximity), stabilizes all queues, and satisfies the delay constraints. The problem is solved by reducing the constrained optimization to a set of weighted stochastic shortest path problems, which act as natural generalizations of max-weight policies to Markov decision networks. We also present approximation results for the corresponding shortest path problems, and discuss the additional complexity and delay incurred as compared to systems without delay constraints. The solution technique is general and applies to other constrained stochastic decision problems.
机译:我们考虑一站式无线系统,该系统具有较少的延迟约束用户和大量的无延迟约束的用户。我们开发了一种调度算法,该算法可对时变信道做出反应,并最大程度地提高吞吐量效用(在所需的邻近范围内),稳定所有队列并满足延迟约束。通过将约束优化减少到一组加权随机最短路径问题来解决该问题,这是对Markov决策网络的最大权重策略的自然概括。我们还给出了对应的最短路径问题的近似结果,并讨论了与没有延迟约束的系统相比所引起的额外复杂性和延迟。该解决方法是通用的,并且适用于其他受约束的随机决策问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号