[69] The traffic capacity and the average shortest path length as a function of the network size under the shortest path routing strategy. Figures 15(a) and 15(b) start from scale-free networks with nodes, while Figures 15(c) and 15(d) start from scale-free networks with nodes. Each result is obtained by averaging over fifty different network configurations. In each figure, the cases of and are marked with gray and black colors. Dotted, dashed, and solid lines are for the “degree preferential attachment” mechanism, the low-degree-first strategy, and our proposed strategy, respectively.
