The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Onset of traffic congestion in complex networks
Abstract
Free traffic flow on a complex network is key to its normal and efficient functioning. Recent works indicate that many realistic networks possess connecting topologies with a scale-free feature: the probability distribution of the number of links at nodes, or the degree distribution, contains a power-law component. A natural question is then how the topology influences the dynamics of traffic flow on a complex network. Here we present two models to address this question, taking into account the network topology, the information-generating rate, and the information-processing capacity of individual nodes. For each model, we study four kinds of networks: scale-free, random, and regular networks and Cayley trees. In the first model, the capacity of packet delivery of each node is proportional to its number of links, while in the second model, it is proportional to the number of shortest paths passing through the node. We find, in both models, that there is a critical rate of information generation, below which the network traffic is free but above which traffic congestion occurs. Theoretical estimates are given for the critical point. For the first model, scale-free networks and random networks are found to be more tolerant to congestion. For the second model, the congestion condition is independent of network size and topology, suggesting that this model may be practically useful for designing communication protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Scientific collaboration networks. I. Network construction and fundamental results
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016131 · Cited by 2,076
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-L., Albert, R., & Jeong, H. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,408
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
Optimal Network Topologies for Local Search with Congestion
Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A., & Arenas, A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.248701 · Cited by 605
Communication in Networks with Hierarchical Branching
Arenas, A., Díaz-Guilera, A., & Guimerà, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3196 · Cited by 449
Topology of the conceptual network of language
Motter, A. E., de Moura, A. P. S., Lai, Y.-C., & Dasgupta, P. (2002) · Physical Review E · doi:10.1103/physreve.65.065102 · Cited by 303
Self-citationPhase transition in a computer network traffic model
Ohira, T., & Sawatari, R. (1998) · Physical Review E · doi:10.1103/physreve.58.193 · Cited by 254
Information transfer and phase transitions in a model of internet traffic
Solé, R. V., & Valverde, S. (2001) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00536-7 · Cited by 190
Dynamical properties of model communication networks
Guimerà, R., Arenas, A., Díaz-Guilera, A., & Giralt, F. (2002) · Physical Review E · doi:10.1103/physreve.66.026704 · Cited by 190
Liu, Z., Lai, Y., Ye, N., & Dasgupta, P. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01317-8 · Cited by 141
Self-citationSelf-organized critical traffic in parallel computer networks
Valverde, S., & Solé, R. V. (2002) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00872-5 · Cited by 125
Performance of data networks with random links
Fukś, H., & Ławniczak, A. T. (1999) · Mathematics and Computers in Simulation · doi:10.1016/s0378-4754(99)00125-1 · Cited by 90
Optimization and phase transitions in a chaotic model of data traffic
Woolf, M., Arrowsmith, D. K., Mondragón-C, R. J., et al. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.66.046106 · Cited by 62
Communication and optimal hierarchical networks
Guimerà, R., Arenas, A., & Dı́az-Guilera, A. (2001) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(01)00302-8 · Cited by 44
Cited by
The physics of spreading processes in multilayer networks
De Domenico, M., Granell, C., Porter, M. A., & Arenas, A. (2016) · Nature Physics · doi:10.1038/nphys3865 · Cited by 649
Efficient routing on complex networks
Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., & Wang, B.-H. (2006) · Physical Review E · doi:10.1103/physreve.73.046108 · Cited by 631
Large-Scale Transportation Network Congestion Evolution Prediction Using Deep Learning Theory
Ma, X., Yu, H., Wang, Y., & Wang, Y. (2015) · PLOS ONE · doi:10.1371/journal.pone.0119044 · Cited by 495
Traffic dynamics based on local routing protocol on a scale-free network
Wang, W.-X., Wang, B.-H., Yin, C.-Y., Xie, Y.-B., & Zhou, T. (2006) · Physical Review E · doi:10.1103/physreve.73.026111 · Cited by 382
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 299
Self-citation
Metadata
- Authors
- Zhao, L., Lai, Y.-C., Park, K., & Ye, N.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-02-24
- Volume
- 71
- Issue
- 2
- Pages
- 026125-026125
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2095931149
- Cited by
- 457
- References
- 22
- FWCI
- 17.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.