In this paper, we propose a biased-shortest path method with minimal congestion. In the
method, we use linear-prediction to estimate the queue length of nodes, and propose a …

We investigate a new efficient packet routing strategy which mitigates traffic congestion on
complex networks. In order to avoid congestion, we minimize the maximum betweenness …

Obtaining the optimum shortest paths for packets from their sources to destinations in
communication networks is referred to as the packet routing problem. In a packet routing …

In this paper, we propose a routing strategy based on the global dynamic information of
network traffic. In the strategy, packets will travel along the path with the minimal sum of links' …

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 …

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 …

By incorporating local traffic information into the basic shortest path routing policy, we
propose a congestion awareness routing strategy with a tunable parameter. We investigate …

We study information packet routing processes on scale-free networks by mimicking the
Internet traffic delivery strategies. We incorporate both the global network structure …

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 …

Networks, acting as infrastructure for information communication, play an important role in
modern society, therefore, the elements affecting the efficiency of network traffic are worthy …