Scaling behavior of an artificial traffic model on scale-free networks

Abstract

In this article, we investigate an artificial traffic model on scale-free networks. Instead of using the routing strategy of the shortest path, a generalized routing algorithm is introduced to improve the transportation throughput, which is measured by the value of the critical point disjoining the free-flow phase and the congested phase. By using the detrended fluctuation analysis, we found that the traffic rate fluctuation near the critical point exhibits the $1/f$-type scaling in the power spectrum. The simulation results agree very well with the empirical data, thus the present model may contribute to the understanding of the underlying mechanism of network traffics.

6 pages, 5 figures

References in corpus (6)

• Efficient routing on complex networks
• Effect of nonlinear filters on detrended fluctuation analysis
• Congestion and centrality in traffic flow on complex networks
• Optimal Paths in Disordered Complex Networks
• An efficient approach of controlling traffic congestion in scale-free networks
• Temporal Series Analysis Approach to Spectra of Complex Networks

Cited by in corpus (1)

• Scaling and memory in recurrence intervals of Internet traffic