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

网络资源分配的分布式拉格朗日方法

Distributed Lagrangian Methods for Network Resource Allocation

Thinh T. Doan, Carolyn L. Beck

摘要:

出于控制工程和信息科学中的各种应用,我们研究网络资源分配问题,其目标是在节点网络上优化分配固定数量的资源。在这些问题中,由于网络规模大,节点之间的互连复杂,任何解决方案都必须并行实现,并只基于本地数据,从而需要分布式算法。在本文中,我们提出了一种新的分布式拉格朗日方法,它只需要本地计算和通信。我们的重点是了解该算法的性能的底层网络拓扑结构。具体来说,我们得到的上界的收敛速率的算法的大小和底层网络的拓扑结构的函数。所提出的方法的有效性和适用性证明其用于解决电力系统中的重要经济调度问题,特别是在基准IEEE-14和IEEE-118总线系统。

英文摘要:

Motivated by a variety of applications in control engineering and information sciences, we study network resource allocation problems where the goal is to optimally allocate a fixed amount of resource over a network of nodes. In these problems, due to the large scale of the network and complicated inter-connections between nodes, any solution must be implemented in parallel and based only on local data resulting in a need for distributed algorithms. In this paper, we propose a novel distributed Lagrangian method, which requires only local computation and communication. Our focus is to understand the performance of this algorithm on the underlying network topology. Specifically, we obtain an upper bound on the rate of convergence of the algorithm as a function of the size and the topology of the underlying network. The effectiveness and applicability of the proposed method is demonstrated by its use in solving the important economic dispatch problem in power systems, specifically on the benchmark IEEE-14 and IEEE-118 bus systems.

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

↑