Traffic dynamics based on local routing strategy in a weighted scale-free network

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, the traffic flow on weighted scale-free networks is investigated based on local routing strategy using link weights: . The capacity of links is controlled by max(β w lj ,1). It is shown by simulations that two critical threshold β c1 and β c2 exist. When β>β c1, both the network capacity and the corresponding α c value remain unchanged. When β c1>β>β c2, the network capacity decreases and the critical value of α c increases with the decrease of β. When β

Cite

CITATION STYLE

APA

Hu, M. B., Wu, Y. H., Jiang, R., Wu, Q. S., & Wang, W. X. (2009). Traffic dynamics based on local routing strategy in a weighted scale-free network. In Traffic and Granular Flow 2007 (pp. 733–738). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-540-77074-9_82

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free