19 November 2009 On allocating redundancy links to improve robustness of complex communication network
Author Affiliations +
Proceedings Volume 7633, Network Architectures, Management, and Applications VII; 76331A (2009) https://doi.org/10.1117/12.852038
Event: Asia Communications and Photonics, 2009, Shanghai, Shanghai , China
Abstract
To improve robustness for the complex network, this paper propose a novel probabilistic approach to allocate redundancy links based on nodal degree, i.e. preferential allocation, inverse preferential allocation, and hiding redundancy links (HRL) strategy. We find that allocating redundancy links can efficiently improve robustness of networks to tolerate the coordinated attack. Especially, I-I case, which both source node and destination node are chosen by inverse preferential allocation, performs the best. Furthermore, we investigate the effects of HRL strategy under the coordinated attack, and the simulation shows that HRL strategy can achieve the better performance than never. More interestingly, the relationship between threshold of crash and the number of redundancy links appears to achieve nonlinear by the HRL strategy. Therefore, a small fraction of redundancy links is highly contributed to improve the tolerance attack dramatically. This paper provides an insight on improving network robustness to tolerant the coordinated attack by allocating redundancy links.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yue Zhuo, Yunfeng Peng, Keping Long, Yinkai Liu, "On allocating redundancy links to improve robustness of complex communication network", Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 76331A (19 November 2009); doi: 10.1117/12.852038; https://doi.org/10.1117/12.852038
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT


Back to Top