We propose a method to enhance the traffic handling capacity of scale-free networks by
enforcing the undirected links to be unidirectional ones, for the global shortest-path routing …

In this paper, a method is proposed to enhance the traffic handling capacity of scale-free
networks by closing or cutting some links between some large-degree nodes, for both local …

The transport efficiency of a network is strongly related to the underlying structure. In this
paper, we propose an efficient strategy named high-betweenness-first (HBF) for the purpose …

Considering the link congestion based traffic model, which can more accurately model the
traffic diffusing process of many real complex systems such as the Internet, we propose an …

Network structure and its traffic capacity are closely related. A reasonable layout of the
network structure can bring a larger traffic capacity. In this paper, a high-contraction …

The most important function of a network is for transporting traffic. Due to the low traffic
capacity of network systems under the global shortest path routing, plenty of heuristic routing …

In this paper, we propose a new routing strategy based on the minimum information path,
named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free …

Based on the consideration of easy implementation of new routing strategies on many real
complex networks such as the Internet, we propose a hybrid routing mechanism composed …

We propose a routing strategy to improve the transportation efficiency on complex networks.
Instead of using the routing strategy for shortest path, we give a generalized routing …

In this paper, an improved routing strategy is proposed for enhancing the traffic capacity of
scale-free networks. Instead of using the information of degree and betweenness centrality …