The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Improved routing strategies for Internet traffic delivery
Open accessAbstract
We analyze different strategies aimed at optimizing routing policies in the Internet. We first show that for a simple deterministic algorithm the local properties of the network deeply influence the time needed for packet delivery between two arbitrarily chosen nodes. We next rely on a real Internet map at the autonomous system level and introduce a score function that allows us to examine different routing protocols and their efficiency in traffic handling and packet delivery. Our results suggest that actual mechanisms are not the most efficient and that they can be integrated in a more general, though not too complex, scheme.
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
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
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
Epidemic outbreaks in complex heterogeneous networks
Moreno, Y., Pastor‐Satorras, R., & Vespignani, A. (2002) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · Cited by 823
Self-citationResilience to damage of graphs with degree correlations
Vázquez, A., & Moreno, Y. (2003) · Physical Review E · doi:10.1103/physreve.67.015101 · Cited by 265
Self-citationEvolution and Structure of the Internet
Pastor‐Satorras, R., & Vespignani, A. (2004) · Cited by 193
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
Self-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
Local versus global knowledge in the Barabási-Albert scale-free network model
Gómez‐Gardeñes, J., & Moreno, Y. (2004) · Physical Review E · doi:10.1103/physreve.69.037103 · Cited by 50
Self-citation
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
Self-citationThe structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Self-citationAnalyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
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
Modelling interdependent infrastructures using interacting dynamical models
Rosato, V., Issacharoff, L., Tiriticco, F., Meloni, S., Porcellinis, S. D., & Setola, R. (2008) · International Journal of Critical Infrastructures · doi:10.1504/ijcis.2008.016092 · Cited by 490
Metadata
- Authors
- Echenique, P., Gómez-Gardeñes, J., & Moreno, Y.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2004-11-15
- Volume
- 70
- Issue
- 5
- Pages
- 056105-056105
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2094357973
- Cited by
- 269
- References
- 14
- FWCI
- 16.50
- Type
- journal article
- Language
- en
- Open access
- green
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.