The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Predicting Internet network distance with coordinates-based approaches
Abstract
We propose using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay). We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the second mechanism, called global network positioning (GNP), which is based on absolute coordinates computed from modeling the Internet as a geometric space. Since end hosts maintain their own coordinates, these approaches allow end hosts to compute their inter-host distances as soon as they discover each other. Moreover, coordinates are very efficient in summarizing inter-host distances, making these approaches very scalable. By performing experiments using measured Internet distance data, we show that both coordinates-based schemes are more accurate than the existing state of the art system IDMaps, and the GNP approach achieves the highest accuracy and robustness among them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
A case for end system multicast
Chu, Y.-H., Rao, S. G., Seshan, S., & Zhang, H. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803066 · Cited by 2,202
Self-citationA case for end system multicast (keynote address)
Chu, Y.-H., Rao, S., & Zhang, H. (2000) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/339331.339337 · Cited by 956
Self-citationTopologically-aware overlay construction and server selection
Ratnasamy, S., Handley, M. J., Karp, R. M., & Shenker, S. J. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2002.1019369 · Cited by 790
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications
Stoica, I., Morris, R., Liben‐Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2001) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 516
An investigation of geographic mapping techniques for internet hosts
Padmanabhan, V. N., & Subramanian, L. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383073 · Cited by 479
Cited by
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159945 · Cited by 260
Sybillimit: a near-optimal social network defense against sybil attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2034047 · Cited by 246
Bhushan, B., & Sahoo, G. (2018) · Wireless Personal Communications · doi:10.1007/s11277-017-4962-0 · Cited by 181
Metadata
- Authors
- Ng, T. S. E., & Zhang, H.
- Venue
- Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 1
- Pages
- 170-179
- OpenAlex
- W2153319198
- Cited by
- 1,050
- References
- 8
- FWCI
- 53.25
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Predicting Internet network distance with coordinates-based approaches. https://app.cochat.ai/papers/10.1109/infcom.2002.1019258
- The paper
- Ng, T. S. E., & Zhang, H. (2003). Predicting Internet network distance with coordinates-based approaches. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. https://doi.org/10.1109/infcom.2002.1019258
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.
