In real communication or transportation systems, loss of agents is very common due to finite
storage capacity. We study the traffic dynamics in finite buffer networks and propose a …

This paper proposed a novel routing strategy with two tunable parameters, α 1, β, based on
the dynamic local information in a finite buffer network. The system behaves differently from …

In real complex systems, the limited storage capacity of physical devices often results in the
loss of data. We study the effect of buffer size on packet loss threshold in scale-free …

In this paper, we study the optimization of network traffic by considering the effects of node
buffer ability and capacity. Two node buffer settings are considered. The node capacity is …

In this paper, we propose an integrated routing strategy based on global static topology
information and local dynamic data packet queue lengths to improve the transmission …

Traffic is essential for many dynamic processes on networks. The efficient routing strategy
[G. Yan, T. Zhou, B. Hu, ZQ Fu, and BH Wang, Phys. Rev. E 73, 046108 (2006)] can reach a …

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

We study the information traffic in scale-free networks where the information generation rate
varies with time as a periodic function. We observe that when the fluctuation in packet …

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