Information routing is one of the most important problems in large communication networks. In this paper we propose a … novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that … incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy is more …

Robustness is one of the crucial properties that needs to be considered in the design of routing strategies on networks …. We study the robustness of three typical routing strategies, which are the SP (shortest path), EP (efficient path), and …

factor of around five when compared to shortest-path routing. …

Using the context of routing efficiency in a complex scale-free network, we study the problem of how a limited amount …

efficient routing. The routing strategies are compared using two generic models, i.e., Barabàsi–Albert scale-free network and … deflection routing algorithm which automatically extends path of the packet before it arrives at congested node. The simulation … results indicate that the dynamic routing strategy can further reduce the number of dropped packets in a combination with the …