{'fraction_non_alphanumeric': 0.019674935842600515, 'fraction_numerical': 0.0, 'mean_word_length': 5.724137931034483, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On allocating redundancy links to improve robustness of complex communication network

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.