Finite-time distributed topology design for optimal network resilience

• Published in: IET control theory & applications Vol. 13; no. 17; pp. 2792 - 2799
• Main Authors: Xue, Dong, Hirche, Sandra
• Format: Journal Article
• Language: English
• Published: The Institution of Engineering and Technology 26.11.2019
• Subjects: approximation theory; complex network; complex networks; distributed algorithms; distributed estimation algorithm; distributed stopping criterion; distributed strategies; eigenvalues and eigenfunctions; eigenvectors and eigenvalues; estimation theory; extensive interest; finite‐time distributed topology design; graph matrices; graph theory; link addition‐rewiring; link manipulation; link‐operation problem; local accessible topology information; malicious attacks; matrix algebra; matrix‐perturbation‐based approximation; network theory (graphs); network topology; network‐based optimisation problems; numerical demonstrations; optimal network resilience; optimisation; Special Issue: Distributed Optimisation and Learning for Networked Systems; estimation theory; malicious attacks; numerical demonstrations; graph theory; distributed stopping criterion; network theory (graphs); complex networks; link addition-rewiring; eigenvalues and eigenfunctions; matrix-perturbation-based approximation; optimisation; distributed estimation algorithm; extensive interest; link manipulation; approximation theory; network-based optimisation problems; complex network; network topology; distributed strategies; link-operation problem; matrix algebra; graph matrices; optimal network resilience; distributed algorithms; finite-time distributed topology design; local accessible topology information; eigenvectors and eigenvalues
• ISSN: 1751-8644; 1751-8652; 1751-8652
• DOI: 10.1049/iet-cta.2018.6117

The process of enhancing the ability of a complex network against various malicious attacks through link addition/rewiring has been the subject of extensive interest and research. The performance of existing methods often highly depends on full knowledge about the network topology. In this study, the authors devote ourselves to developing new distributed strategies to perform link manipulation sequentially using only local accessible topology information. This strategy is concerned with a matrix-perturbation-based approximation of the network-based optimisation problems and a distributed algorithm to compute eigenvectors and eigenvalues of graph matrices. In addition, the development of a distributed stopping criterion, which provides the desired accuracy on the distributed estimation algorithm, enables us to solve the link-operation problem in a finite-time manner. Finally, all results are illustrated and validated using numerical demonstrations and examples.