Multi-layer Decomposition of Optimal Resource Sharing Problems
Multi-layer Decomposition of Optimal Resource Sharing Problems
复制标题
DOI：
10.1109/cdc.2018.8619777
复制
发表时间：
2018-12
期刊：
影响因子：
--
通讯作者：
Nurullah Karakoç;A. Scaglione;A. Nedić
中科院分区：
文献类型：
--
作者：
Nurullah Karakoç;A. Scaglione;A. Nedić
我们描述了我们在通信，微观经济学和各种网络应用程序中面临的资源共享问题的分布式框架。特别是，我们考虑了网络实用程序最大化（NUM）的层次多层分解，其中功能分配给不同的层。所提出的方法创建具有中央管理和分布式计算的解决方案。该技术旨在通过降低通信成本来响应网络的动态，同时将更多的计算负载转移到网络边缘。这项工作的主要贡献是提供详细分析的假设，即网络变化与用于本地计算的算法的收敛时间相同的时间尺度。在这种情况下，假设用户目标功能的强烈凹度和平滑度，我们呈现每一层的收敛速度。
We describe a distributed framework for resource sharing problems that we face in communications, microeconomics and various networking applications. In particular, we consider a hierarchical multi-layer decomposition for network utility maximization (NUM), where functionalities are assigned to different layers. The proposed methodology creates solutions having central management and distributed computations. The technique aims to respond to the dynamics of the network by decreasing the communication cost, while shifting more computational load to the edges of the network. The main contribution of this work is the provision of a detailed analysis under the assumption that the network changes are in the same time-scale with the convergence time of the algorithms used for local computations. For this scenario, assuming strong concavity and smoothness of the users' objective functions, we present convergence rates for each layer.