Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction
The DOI matches its Crossref record.
Abstract
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-to-peer realm. One scalable approach to estimate distances between nodes is to embed the nodes in some d dimensional geometric space and to use the pair distances in this space as the estimate for the real distances. Several algorithms were suggested in the past to do this in low dimensional Euclidean spaces. It was noted in recent years that the Internet structure has a highly connected core and long stretched tendrils, and that most of the routing paths between nodes in the tendrils pass through the core. Therefore, we suggest in this work, to embed the Internet distance metric in a hyperbolic space where routes are bent toward the center. We found that if the curvature, that defines the extend of the bending, is selected in the adequate range, the accuracy of Internet distance embedding can be improved. We demonstrate the strength of our hyperbolic embedding with two applications: selecting the closest server and building an application level multicast tree. For the latter, we present a distributed algorithm for building geometric multicast trees that achieve good trade-offs between delay (stretch) and load (stress). We also present a new efficient centralized embedding algorithm that enables the accurate embedding of short distances, something that have never been done before.
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
Cited by
Sustaining the Internet with hyperbolic mapping
Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463
Network Mapping by Replaying Hyperbolic Growth
Papadopoulos, F., Psomas, C., & Krioukov, D. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2294052 · Cited by 158
Large-scale curvature of networks
Narayan, O., & Saniee, I. (2011) · Physical Review E · doi:10.1103/physreve.84.066108 · Cited by 145
Tree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Hyperbolic Entailment Cones for Learning Hierarchical Embeddings
Ganea, O.-E., Bécigneul, G., & Hofmann, T. (2018) · arXiv · doi:10.48550/arxiv.1804.01882 · Cited by 115
Metadata
- Authors
- Shavitt, Y., & Tankel, T.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2008-02
- Volume
- 16
- Issue
- 1
- Pages
- 25-36
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2168891622
- Cited by
- 123
- References
- 0
- FWCI
- 17.56
- 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.