.png){kind=icon}
返回
Asynchronous Algorithms for Decentralized Resource Allocation Over Directed Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2022.3212424.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we consider a class of decentralized resource allocation problems over directed networks, where each node only communicates with its in-neighbors and attempts to minimize its own cost when network-wide resource constraints as well as local capacity limits are satisfied. Decentralized optimization to solve this problem has been a significant focus within engineering research due to its advantages in scalability, robustness, and flexibility. Most existing methods are synchronous while few works are devoted to asynchronously solving the problem. The problem becomes even more challenging when the networks are directed. To address the resource allocation problem when the above issues are considered, we propose a novel decentralized asynchronous algorithm based on the gossip-based communication protocol and epigraph strategy. An important feature of the algorithm is that it is implemented in a completely decentralized manner in the case of asynchronous communication and directed networks. We provide theoretical proof to guarantee the convergence of the proposed algorithm, which indicates that it can successfully allocate the optimal resource. When solving the resource allocation problem over time-varying directed networks, we further discuss a related decentralized asynchronous algorithm according to the random sleep protocol. Numerical examples are given to demonstrate the viability and performance of the algorithms.
Keyword:
Resource allocation
decentralized asynchronous algorithm
gossip-based communication protocol
epigraph strategy
time-varying directed networks
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Empirical triatomic potential energy surfaces defined over orthogonal bond order coordinates在正交键序坐标上定义的经验三原子势能面
PREAI
分享收藏分享收藏Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Fast and Communication-Efficient Algorithm for Distributed Support Vector Machine Training快速通信高效的分布式支持向量机训练算法
PREAI
分享收藏
查看更多内容