A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks

Saleh Al-Takrouri and Andrey V. Savkin

Physica A: Statistical Mechanics and its Applications, 2013, vol. 392, issue 23, 6135-6145

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.

Keywords: Complex networks; Cascaded failure; Maximum flow; Distributed algorithms; Randomized algorithms (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437113007097
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:392:y:2013:i:23:p:6135-6145

DOI: 10.1016/j.physa.2013.07.078

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().