Effective strategy of adding links for improving network transport efficiency on complex networks
Abstract
In this paper, we propose an efficient strategy to enhance the network transport efficiency by adding links to the existing networks. In our proposed strategy, we consider both the node betweenness centrality (BC) and the shortest path length (L) as two important factors. The overall traffic capacity of a network system can be evaluated by the critical packet generating rate Rc. Simulation results show that the proposed strategy can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy and the low-betweenness-first (LBF) strategy. This work is helpful for designing and optimizing of realistic networks.
- Publication:
-
International Journal of Modern Physics C
- Pub Date:
- January 2014
- DOI:
- 10.1142/S0129183114500144
- Bibcode:
- 2014IJMPC..2550014Z
- Keywords:
-
- Link adding strategy;
- scale-free networks;
- betweenness centrality;
- average shortest path length;
- traffic capacity;
- network structure;
- 89.75.Hc;
- 89.75.Fb;
- 89.40.-a;
- Networks and genealogical trees;
- Structures and organization in complex systems;
- Transportation