Abstract
The effect of link and node capacity on traffic dynamics are investigated in weighted scale-free networks by adopting a traffic routing model with local node strength information: \(P_{l \rightarrow i} = \frac{S_{i}^{\alpha}}{\sum_j S_{j}^{\alpha}}\). The link bandwidth is controlled by: B ij = max (βw ij ,1), and the capacity of nodes is controlled by: max (γs i , 1). The phase transition from free flow to congestion is reproduced. The optimal routing strategy is sought out. When β increases from zero, the optimal strategy changes from preferring low-strength nodes to high-strength nodes. When β ≈ 1.0, there will be two optimal routing strategies. When β is low, the system’s behavior is controlled by link bandwidth, while it is controlled by node capacity when β is high. Our work may be useful for the design of modern traffic systems and communication networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Adv. Phys. 51, 1079–1187 (2002)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)
Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: Structure and dynamics. Phys. Rep. 424, 175–308 (2006)
Latora, V., Marchiori, M.: How the science of complex networks can help developing strategies against terrorism. Chaos, Solitons and Fractals 20(1), 69–75 (2004)
Li, C.G., Chen, G.R.: Local stability and Hopf bifurcation in small-world delayed networks. Chaos, Solitons and Fractals 20(2), 353–361 (2004)
Zhang, H.F., Wu, R.X., Fu, X.C.: The emergence of chaos in complex dynamical networks. Chaos, Solitons and Fractals 28(2), 472–479 (2006)
Arenas, A., Díaz-Guilerà, A., Guimerà, R.: Communication in networks with hierarchical branching. Phys. Rev. Lett. 86, 3196–3199 (2001)
Guimerà, R., Arenas, A., Díaz-Guilera, A., Giralt, F.: Dynamical properties of model communication networks. Phys. Rev. E 66, 026704 (2002)
Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A., Arenas, A.: Optimal network topologies for local search with congestion. Phys. Rev. Lett. 89, 248701 (2002)
Guimerà, R., Danon, L., Díaz-Guilerà, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68, 065103(R) (2003)
Tadić, B., Thurner, S., Rodgers, G.J.: Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations. Phys. Rev. E 69, 036102 (2004)
Tadić, B., Thurner, S.: Information super-diffusion on structured networks. Physica A 332, 566–584 (2004)
Tadić, B., Thurner, S.: Search and topology aspects in transport on scale-free networks. Physica A 346, 183–190 (2005)
Noh, J.D., Rieger, H.: Random walks on complex networks. Phys. Rev. Lett. 92, 118701 (2004)
Zhao, L., Park, K., Lai, Y.C.: Attack vulnerability of scale-free networks due to cascading breakdown. Phys. Rev. E 70, 035101(R) (2004)
Yan, G., Zhou, T., Hu, B., Fu, Z.Q., Wang, B.H.: Efficient routing on complex networks. Phys. Rev. E 73, 046108 (2006)
de Moura, A.P.S.: Fermi-Dirac statistics and traffic in complex networks. Phys. Rev. E 71, 066114 (2005)
Wang, W.X., Wang, B.H., Yin, C.Y., Xie, Y.B., Zhou, T.: Traffic dynamics based on local routing protocol on a scale-free network. Phys. Rev. E 73, 026111 (2006)
Barrat, A., Barthélemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proc. Natl. Acad. Sci. U.S.A. 101, 3747–3752 (2004)
Macdonald, P.J., Almaas, E., Barabási, A.L.: Minimum spanning trees of weighted scale-free networks. Europhys. Lett. 72, 308–314 (2005)
Dorogovtsev, S.N., Mendes, J.F.F.: Scaling behaviour of developing and decaying networks. Europhys. Lett. 52, 33–39 (2000)
Barrat, A., Barthélemy, M., Vespignani, A.: Weighted evolving networks: Coupling topology and weight dynamics. Phys. Rev. Lett. 92, 228701 (2004)
Abe, S., Thurner, S.: Complex networks emerging from fluctuating random graphs: Analytic formula for the hidden variable distribution. Phys. Rev. E 72, 036102 (2005)
Wang, W.X., Wang, B.H., Hu, B., Yan, G., Ou, Q.: General dynamics of topology and traffic on weighted technological networks. Phys. Rev. Lett. 94, 188702 (2005)
Motter, A.E., Zhou, C.S., Kurths, J.: Network synchronization, diffusion, and the paradox of heterogeneity. Phys. Rev. E 71, 016116 (2005)
Zhou, C.S., Motter, A.E., Kurths, J.: Universality in the synchronization of weighted random networks. Phys. Rev. Lett. 96, 034101 (2006)
Zhang, Z.Z., Zhou, S.G., Chen, L.C., Guan, J.H., Fang, L.J., Zhang, Y.C.: Recursive weighted treelike networks. Eur. Phys. J. B 59, 99–107 (2007)
Xie, Y.B., Wang, W.X., Wang, B.H.: Modeling the coevolution of topology and traffic on weighted technological networks. Phys. Rev. E 75, 026111 (2007)
Bollobás, B.: Modern Graph Theory. Springer, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Hu, M.B., Jiang, R., Wu, Y.H., Wu, Q.S. (2009). The Effects of Link and Node Capacity on Traffic Dynamics in Weighted Scale-Free Networks. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02466-5_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-02466-5_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02465-8
Online ISBN: 978-3-642-02466-5
eBook Packages: Computer ScienceComputer Science (R0)