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.
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
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
A survey on security issues in service delivery models of cloud computing
Subashini, S., & Kavitha, V. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2010.07.006 · Cited by 2,625
A survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
Vivaldi: a decentralized network coordinate system
Dabek, F., Cox, R., Kaashoek, F., & Morris, R. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015471 · Cited by 1,154
Rainbow: architecture-based self-adaptation with reusable infrastructure
Garlan, D., Cheng, S.-W., Huang, A.-C., Schmerl, B., & Steenkiste, P. (2004) · Computer · doi:10.1109/mc.2004.175 · Cited by 1,005
Restful web services vs. "big"' web services: making the right architectural decision
Pautasso, C., Zimmermann, O., & Leymann, F. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367606 · Cited by 879
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945475 · Cited by 818
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159945 · Cited by 725
Toward Secure and Dependable Storage Services in Cloud Computing
Wang, C., Wang, Q., Ren, K., Cao, N., & Lou, W. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.24 · Cited by 643
Internet indirection infrastructure
Stoica, I., Adkins, D., Zhuang, S., Shenker, S., & Surana, S. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633033 · Cited by 642
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
iPlane: an information plane for distributed services
Madhyastha, H. V., Isdal, T., Piatek, M., Dixon, C., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2006) · doi:10.5555/1298455.1298490 · Cited by 526
Greening geographical load balancing
Liu, Z., Lin, M., Wierman, A., Low, S. H., & Andrew, L. L. H. (2011) · Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/1993744.1993767 · Cited by 467
Network-Aware Operator Placement for Stream-Processing Systems
Pietzuch, P., Ledlie, J., Shneidman, J., Roussopoulos, M., Welsh, M., & Seltzer, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.105 · Cited by 428
Bounded geometries, fractals, and low-distortion embeddings
Gupta, A., Krauthgamer, R., & Lee, J. R. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238226 · Cited by 405
SybilGuard: Defending Against Sybil Attacks via Social Networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923723 · Cited by 394
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Characterizing residential broadband networks
Dischinger, M., Haeberlen, A., Gummadi, K. P., & Saroiu, S. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298313 · Cited by 341
Virtual landmarks for the internet
Tang, L., & Crovella, M. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948223 · Cited by 297
Fast shortest path distance estimation in large networks
Potamias, M., Bonchi, F., Castillo, C., & Gionis, A. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646063 · Cited by 291
Constraint-Based Geolocation of Internet Hosts
Gueye, B., Ziviani, A., Crovella, M., & Fdida, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886332 · Cited by 288
Sripanidkulchai, K., Ganjam, A., Maggs, B., & Zhang, H. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015480 · Cited by 268
Self-citationSybilGuard: 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
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.