Abstract
A decentralized control algorithm for routing flow in complex networks is proposed. The aim is to fairly distribute the supply/demand among the nodes while maintaining maximum flow in the network and satisfying the flow limits of the nodes and links. The algorithm is also used for flow re-routing after a failure in (or attack on) a network to avoid a cascading 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. Consensus rules are used to achieve fairness between the nodes in the network. The performance of the proposed algorithm is demonstrated by simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
