In this paper, we propose a routing strategy based on the global dynamic information of network traffic. In the …. Furthermore, we compare the performance of the strategy with global dynamic (GD) routing strategy. It is found that the strategy …

an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions … optimal routing strategy (SORS), which proportionally deliver packets along the path according to the optimal packet flow …

this paper, we propose an adaptive routing strategy that incorporates geographical distance with local traffic information …

Shortest Path routing strategy trying to avoid the modules of traffic congestion, which means that we adopt the shortest … routing strategy both in the inter-modules and in the intra-module. Simulations show that this routing algorithm is superior …

This study proposes a probability routing strategy for improving traffic capability on scale-free networks. Compared … with the shortest path routing strategy depending on central nodes largely and the efficient routing strategy avoiding hub … routers as much as possible, the probability routing strategy makes use of hub routers more efficiently, transferring …

In this paper, an optimal routing strategy is proposed to enhance the traffic capacity of complex networks. In order to …

In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR …

In this paper, an improved routing strategy is proposed for enhancing the traffic capacity of scale-free networks …