.png){kind=icon}
.png){kind=icon}
Return
Distributed allocation and resource scheduling algorithms resilient to link failure
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejcon.2025.101405.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Clearly defining the problem of distributed resource allocation as a formal mathematical optimization setup. • Proposing a distributed resource allocation algorithm with optimal convergence over uniformly-connected networks while addressing all-time feasibility. • Proving algorithm convergence and resilience under random link failure and time-delayed communication links.
Journal
IF:
2.6
Papers:
323
Citations:
2.5K