Yue Zhuo

Static weighted routing strategy on two-layer complex networks

The routing strategy is important to information dissemination and exchange in complex communication networks. The traditional routing strategies are often insufficient to alleviate congestion and enhance the utilization efficiency of two-layer complex networks. In this paper, a novel efficient static weighted routing strategy is proposed. The weight of the logical edges mapped on the hub nodes at the physical layer is assigned a higher weight according to the degree of nodes. Then packets choose the routing path with the minimum sum weight of logical edges. It is found that the average packet transmission time and average throughput have been improved greatly compared to the shortest path routing strategy in two-layer complex networks.

A new way to improve the robustness of complex communication networks by allocating redundancy links

We investigate the robustness of complex communication networks on allocating redundancy links. The protecting key nodes (PKN) strategy is proposed to improve the robustness of complex communication networks against intentional attack. Our numerical simulations show that allocating a few redundant links among key nodes using the PKN strategy will significantly increase the robustness of scale-free complex networks. We have also theoretically proved and demonstrated the effectiveness of the PKN strategy. We expect that our work will help achieve a better understanding of communication networks.

Improving the attack tolerance of scale-free networks by adding and hiding edges

An edge compensatory model with the tunable parameter α to guide the process of enhancing the robustness of scale-free (SF) networks by adding new edges is presented. In addition, the ability of the model with different α to resist intentional attacks, simulated as the breakdown of a group of network nodes chosen according to degree, is explored. Simulations show that the robustness against intentional attack can be improved when α< 2. Once α is decreased to − 2, reducing α further does little to enhance the robustness of SF networks. Moreover, a novel edge information protection strategy is proposed. Empirical results have demonstrated how robustness is affected by the strategy. We find that hiding a small quantity of new edges contributes to the improvement of SF networks on attack tolerance. Due to the low cost of hiding edge information and the strongly improved network robustness, the strategy is a cost-efficient enhancement of robustness.

Improving robustness of complex communication networks by allocating redundancy links

This paper propose a novel probabilistic approach to allocate redundancy links and hiding redundancy links (HRL) strategy to improve robustness of complex communication networks. We find that allocating redundancy links can efficiently improve robustness against coordinated attack. The simulation shows that HRL strategy can achieve the better performance.

Improving robustness against the coordinated attack by removing crashed hub nodes in complex network

Recently, several distributed attacks based on local information have been emerged threating network security. The coordinated attack is one of the most destructive attacks, with an important property to identify the next-step target through coordinating all crashed nodes. It has been ignored in most of existing researches that the crashed nodes network size will become larger and larger along with the coordinated attack, which makes the coordinated attack crash each node in the same time virtually impossible. In this work, we propose R.C.H strategy, which removes a fraction of crashed hub nodes to improve network robustness against the coordinated attack. The simulation shows that R.C.H strategy is highly contribute to degrade efficiency of the coordinated attack by means of the larger cluster diameter of the crashed node network, which provides some insights for the future research on enhancing robustness of complex communication networks.

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.

Survivability optimization and analysis of network topology based on average distance

A method is proposed to optimize the network survivability based on average distance. We explain the merit of shorter average distance and design the topologies which have minimum average distance then choose the optimal network from them by the network performance analysis under random failure.

Improving robustness against coordinated attack by removing crashed hub nodes in complex communication network

Along with a distributed attack called coordinated attack, its crashed nodes network will become larger and larger, which makes coordinated attack crash each node in the same time virtually impossible. So we propose R.C.H strategy by removing the crashed hub nodes to improve network robustness against coordinated attack.