Implantation of the global dynamic routing scheme in scale-free networks under the shortest path strategy.

The shortest path is a basic routing model which is still used in many systems. However, due to the low exploitation of the delivery capacity of peripheral nodes, the performance achieved by this policy is very limited. Starting from the fact that changing all network routers by others more robust is not practical, we propose the improvement of the capacity of a scale-free network under the shortest path strategy by the implantation of global dynamic routers. We have studied two targeting approaches to designate specific nodes to route the packets following the global dynamic protocol; one is based on node degree and the other on its betweenness. We show that we already exceed twice the capacity under the shortest path protocol with only 4 % of global dynamic routers when we target nodes with high betweenness and 10 % when we target nodes with high degrees. Moreover, the average travelling time remains low while the network capacity increases. [ABSTRACT FROM AUTHOR]