A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
| dc.contributor.author | Altakrouri, Saleh | |
| dc.contributor.author | Savkin, Andrey V. | |
| dc.date.accessioned | 2023-06-17T19:36:39Z | |
| dc.date.available | 2023-06-17T19:36:39Z | |
| dc.date.issued | 2013 | |
| dc.description.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. | en_US |
| dc.identifier.other | https://doi.org/10.1016/j.physa.2013.07.078 | |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/8896 | |
| dc.language.iso | en | en_US |
| dc.publisher | Physica A: Statistical Mechanics and its Applications | en_US |
| dc.subject | Complex networks | en_US |
| dc.subject | Cascaded failure | en_US |
| dc.subject | Maximum flow | en_US |
| dc.subject | Distributed algorithms | en_US |
| dc.subject | Randomized algorithms | en_US |
| dc.title | A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks | en_US |
| dc.type | Article | en_US |