We present a heuristic algorithm for the optimization of transport on complex networks.
Previously proposed network transport optimization algorithms aim at avoiding or reducing …

We present a comparative study of the application of a recently introduced heuristic
algorithm to the optimization of transport on three major types of complex networks. The …

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 …

We present a study of transport on complex networks with routing based on local
information. Particles hop from one node of the network to another according to a set of …

Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree
connecting all nodes with the minimum total weight. We find that the MST can be partitioned …

The efficiency of traffic routing on complex networks can be reflected by two key
measurements, ie, the network capacity and the average travel time of data packets. In this …

We consider the effect of network topology on the optimality of packet routing which is
quantified by γ c, the rate of packet insertion beyond which congestion and queue growth …

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 …

We present an efficient routing approach for delivering packets in complex networks. On
delivering a message from a node to a destination, a node forwards the message to a …

We show that the capacity of a complex network that models a city street grid to support
congested traffic can be optimized by using routes that collectively minimize the maximum …