With rapid economic and social development, the problem of traffic congestion is getting
more and more serious. Accordingly, network traffic models have attracted extensive …

We introduce an adaptive delivering capacity mechanism into the traffic dynamic model on
scale-free networks under shortest path routing strategy and focus on its effect on the …

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 …

We propose a limited packet-delivering capacity model for traffic dynamics in scale-free
networks. In this model, the total node's packet-delivering capacity is fixed, and the …

We studied the information traffic in Barabási–Albert scale-free networks wherein each node
has a finite queue length to store the packets. It is found that in the case of the shortest path …

Recently, motivated by the pioneer works in revealing the small-world effect and scale-free
property of various real-life networks, many scientists devote themselves to studying …

By incorporating local traffic information into the shortest path routing strategy, we
numerically investigate the effectiveness of the traffic awareness routing strategy for scale …

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 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 …

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 …