Robustness of probability routing strategy in interconnection networks

Abstract

Abstract With the rapid development of complex networks, the research on robustness has gradually attracted the attention of scholars. In this paper, the research mainly focuses on the analysis of the stability and vulnerability of probability routing strategy on interconnection networks. Firstly, random attacks or target attacks are carried out on the network, and then its maximum connected subgraph is calculated, and the routing strategy is applied to the maximum connected subgraph. This paper evaluates the strategy’s robustness by examining some network parameters. Simulation outcomes reveal that in comparison to effective routing and the shortest path routing strategies, the probability routing strategy demonstrates superior robustness, evidenced by its performance in terms of network traffic capacity and average path length.