arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.01517cs.NI
收藏

部分可控网络的最优网络控制

Optimal Network Control in Partially-Controllable Networks

Qingkai Liang, Eytan Modiano

摘要:

许多最佳网络控制算法的有效性(例如,背压)依赖于所有节点都是完全可控的前提。然而,这些算法在部分可控的网络中可能会产生较差的性能,其中节点的子集是不可控的,并且使用一些未知的策略。这种部分可控的模型在诸如重叠网络的真实世界网络系统中越来越重要。在本文中,我们设计的最优网络控制算法,可以稳定的部分可控网络。我们首先研究的情况下,不可控的节点使用一个不可知的策略,并提出了一个低复杂度的吞吐量优化算法,称为跟踪最大权重(TMW),它增强了原来的最大权重算法与不可控的节点所使用的政策的明确学习。接下来,我们调查的情况下,不可控的节点使用依赖于策略和问题制定为一个MDP未知的动态的竞争。我们提出了一种新的强化学习算法,称为截断上置信度强化学习(TUCRL),并证明了TUCRL实现了可调的吞吐量,延迟和收敛速度之间的三方权衡。

英文摘要:

The effectiveness of many optimal network control algorithms (e.g., BackPressure) relies on the premise that all of the nodes are fully controllable. However, these algorithms may yield poor performance in a partially-controllable network where a subset of nodes are uncontrollable and use some unknown policy. Such a partially-controllable model is of increasing importance in real-world networked systems such as overlay-underlay networks. In this paper, we design optimal network control algorithms that can stabilize a partially-controllable network. We first study the scenario where uncontrollable nodes use a queue-agnostic policy, and propose a low-complexity throughput-optimal algorithm, called Tracking-MaxWeight (TMW), which enhances the original MaxWeight algorithm with an explicit learning of the policy used by uncontrollable nodes. Next, we investigate the scenario where uncontrollable nodes use a queue-dependent policy and the problem is formulated as an MDP with unknown queueing dynamics. We propose a new reinforcement learning algorithm, called Truncated Upper Confidence Reinforcement Learning (TUCRL), and prove that TUCRL achieves tunable three-way tradeoffs between throughput, delay and convergence rate.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑