Learning for serving deadline-constrained traffic in multi-channel wireless networks
Learning for serving deadline-constrained traffic in multi-channel wireless networks
复制标题
学习在多通道无线网络中服务期限受限的流量
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
A. Eryilmaz
中科院分区：
文献类型：
--
作者：
Semih Cayci;A. Eryilmaz
研究了在信道状态随时间变化且统计量未知的多信道通信系统中，对随机到达和时延敏感业务的服务问题。这个问题偏离了经典的探索-开发设置，因为设计和分析必须适应分组可用性和紧急性的动态以及在决策时每个信道使用的成本。为此，我们已经开发和研究了两个政策，一个基于索引（UCB截止日期）和其他贝叶斯（TS截止日期），这两个执行动态信道分配决策，将这些流量的要求和成本。在对称信道条件下，我们已经证明了UCB的最后期限政策，可以实现有限的遗憾，在可能的情况下，使用一个信道的成本是不是太高，以防止所有的传输，和对数遗憾，否则。在我们的数值研究中，我们还表明，TS-截止日期实现上级性能超过其UCB对应，使其成为一个潜在的有用的替代时，快速收敛到最优是重要的。
We study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical exploration-exploitation setting in that the design and analysis must accommodate the dynamics of packet availability and urgency as well as the cost of each channel use at the time of decision. To that end, we have developed and investigated two policies, one index-based (UCB-Deadline) and the other Bayesian (TS-Deadline), both of which perform dynamic channel allocation decisions that incorporate these traffic requirements and costs. Under symmetric channel conditions, we have proved that the UCB-Deadline policy can achieve bounded regret in the likely case where the cost of using a channel is not too high to prevent all transmissions, and logarithmic regret otherwise. In our numerical studies, we also show that TS-Deadline achieves superior performance over its UCB counterpart, making it a potentially useful alternative when fast convergence to optimal is important.