How to improve the transmission efficiency of Internet-like packet switching networks is one
of the most important problems in complex networks as well as for the Internet research …

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 study the traffic dynamics in complex networks where each link is assigned a limited and
identical bandwidth. Although the first-in–first-out (FIFO) queuing rule is widely applied in the …

In this Letter, we propose a new routing strategy with a single tunable parameter α only
based on local information of network topology. The probability that a given node i with …

The capacity of maximum end-to-end traffic flow the network is able to handle without
overloading is an important index for network performance in real communication systems …

We propose a packet routing strategy with a tunable parameter α based on the local
structural information of a scale-free network. As free traffic flow on the communication …

In the present paper, we consider three different types of networks (random, small-world,
and scale-free) with dynamic weights and focus on how the characteristic parameters …

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 …

In this paper, we propose a new routing strategy on the basis of the so-called next-nearest-
neighbor search strategy by introducing a preferential delivering exponent α. It is found that …

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 …