The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Virtual landmarks for the internet
Abstract
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned a set of coordinates, and Euclidean distance is used to form the desired estimate. Two key questions are: How accurate are coordinate schemes across the Internet as a whole? And: are coordinate assignment schemes fast enough, and scalable enough, for large scale use? In this paper we make contributions toward answering both those questions. Whereas the coordinate assignment problem has in the past been approached by nonlinear optimization, we develop a faster method based on dimensionality reduction of the Lipschitz embedding. We show that this method is reasonably accurate, even when applied to measurements spanning the Internet, and that it naturally leads to a scalable measurement strategy based on the notion of virtual landmarks.
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
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
RADAR: an in-building RF-based user location and tracking system
Bahl, P., & Padmanabhan, V. N. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832252 · Cited by 8,380
Numerical Recipes--The Art of Scientific Computing.
Fritsch, F. N., Press, W. H., Flannery, B. P., Teukolsky, S. A., & Vetterling, W. T. (1988) · Mathematics of Computation · doi:10.2307/2007938 · Cited by 4,845
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
Multidimensional Scaling: I. Theory and Method
Torgerson, W. S. (1952) · Psychometrika · doi:10.1007/bf02288916 · Cited by 2,126
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Predicting Internet network distance with coordinates-based approaches
Ng, T. S. E., & Zhang, H. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019258 · Cited by 1,050
Theory and Applications of Distance Geometry
Blumenthal, L. M. (1970) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,003
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B. (1984) · Medical Entomology and Zoology · Cited by 661
Gummadi, K. P., Saroiu, S., & Gribble, S. D. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571700 · Cited by 625
On lipschitz embedding of finite metric spaces in Hilbert space
Bourgain, J. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02776078 · Cited by 560
Lindzey, G. E., & Aronson, E. (1985) · Random House eBooks · Cited by 508
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
Multidimensional Scaling: History, Theory and Applications.
Pigden, N., Young, F. W., & Hamer, R. M. (1988) · The Statistician · doi:10.2307/2348396 · Cited by 472
Estimating 3D hand pose from a cluttered image
Athitsos, V., & Sclaroff, S. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211500 · Cited by 379
Properties of embedding methods for similarity searching in metric spaces
Hjaltason, G. R., & Samet, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195989 · Cited by 216
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
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
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
Metadata
- Authors
- Tang, L., & Crovella, M.
- Venue
- Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03
- Publisher
- ACM Press
- Published
- 2003
- Pages
- 143
- OpenAlex
- W2117897639
- Cited by
- 297
- References
- 17
- Type
- conference abstract
- 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.