The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Phase transition in a computer network traffic model
Abstract
We propose and study here a simple model of computer network traffic that can exhibit a phase transition from a low to high congestion state measured in terms of average travel time of packets as a function of the packet creation rate in the network. In the model, packets are generated with destination addresses, and are transferred from one router to another toward their destinations. The routers are capable of queuing packets and autonomously selecting a path to the next router for a packet. Through simulations on a two-dimensional lattice model network, we found that the phase transition point into the congestion phase depends on how each router chooses a path for the packets in its queue. In particular, an appropriate randomness in path selection can shift the onset of traffic congestion to accommodate more packets in the model network.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
The Handbook of brain theory and neural networks
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4484 · Cited by 3,870
Dynamical model of traffic congestion and numerical simulation
Bando, M., Hasebe, K., Nakayama, A., Shibata, A., & Sugiyama, Y. (1995) · Physical Review E · doi:10.1103/physreve.51.1035 · Cited by 3,013
Stochastic resonance and the benefits of noise: from ice ages to crayfish and SQUIDs
Wiesenfeld, K., & Moss, F. (1995) · Nature · doi:10.1038/373033a0 · Cited by 1,830
Self-organization and a dynamical transition in traffic-flow models
Biham, O., Middleton, A. A., & Levine, D. (1992) · Physical Review A · doi:10.1103/physreva.46.r6124 · Cited by 839
Bulsara, A. R., & Gammaitoni, L. (1996) · Physics Today · doi:10.1063/1.881491 · Cited by 497
Critical behaviors and 1/Φ noise in information traffic
Takayasu, M., Takayasu, H., & Sato, T. (1996) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(96)00189-6 · Cited by 131
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
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
Onset of traffic congestion in complex networks
Zhao, L., Lai, Y.-C., Park, K., & Ye, N. (2005) · Physical Review E · doi:10.1103/physreve.71.026125 · Cited by 457
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
Metadata
- Authors
- Ohira, T., & Sawatari, R.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 1998-07-01
- Volume
- 58
- Issue
- 1
- Pages
- 193-195
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2001158282
- Cited by
- 254
- References
- 7
- FWCI
- 7.12
- 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.