The information transmission in community networks

• This strategy is avoiding the modules of traffic congestion.
• Our algorithm is superior with appropriate selection of the tunable parameters.
• Our algorithm can also be improved by integrating other routing strategies.
• This strategy takes less time.

The community structure has been empirically found in many real networks. This paper proposes an efficient Double 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 to the traditional shortest path routing protocol with appropriate selection of the tunable parameters. In addition, this algorithm can also be improved by integrating it with several alternative routing strategies.