| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10480906 | Physica A: Statistical Mechanics and its Applications | 2013 | 11 Pages |
Abstract
A decentralized random algorithm for flow distribution in complex networks is proposed. The aim is to maintain the maximum flow while satisfying the flow limits of the nodes and links in the network. The algorithm is also used for flow redistribution after a failure in (or attack on) a complex network to avoid a cascaded failure while maintaining the maximum flow in the network. The proposed algorithm is based only on the information about the closest neighbours of each node. A mathematically rigorous proof of convergence with probability 1 of the proposed algorithm is provided.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Saleh Al-Takrouri, Andrey V. Savkin,