• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Triangulation and Embedding using Small Sets of Beacons (2008)

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [www.microsoft.com]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.oberlin.edu]
  • [www.cs.oberlin.edu]
  • [www-graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [graphics.stanford.edu]
  • [formaurbis.stanford.edu]
  • [web.sau.edu]
  • [www-hci.stanford.edu]
  • [research.microsoft.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jon Kleinberg , Aleksandrs Slivkins , Tom Wexler
Citations:96 - 11 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Kleinberg08triangulationand,
    author = {Jon Kleinberg and Aleksandrs Slivkins and Tom Wexler},
    title = {Triangulation and Embedding using Small Sets of Beacons },
    year = {2008}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by node-to-node latencies in the Internet, resulting in a number of recent approaches that approximately embed this distance matrix into low-dimensional Euclidean space. There is a fundamental distinction, however, between the theoretical approaches to the embedding problem and this recent Internet-related work: in addition to computational limitations, Internet measurement algorithms operate under the constraint that it is only feasible to measure distances for a linear (or near-linear) number of node pairs, and typically in a highly structured way. Indeed, the most common framework for Internet measurements of this type is a beacon-based approach: one chooses uniformly at random a constant number of nodes (‘beacons’) in the network, each node measures its distance to all beacons, and one then has access to only these measurements for the remainder of the algorithm. Moreover, beacon-based algorithms are often designed not for embedding but for the more basic problem of triangulation, in which one uses the triangle inequality to infer the distances that have not been measured. Here we give algorithms with provable performance guarantees for beacon-based triangulation and

Keyphrases

small set    distance matrix    constant number    recent theoretical interest    embedding problem    provable performance guarantee    node-to-node latency    triangle inequality    beacon-based triangulation    low-dimensional euclidean space    theoretical approach    fundamental distinction    metric embedding    beacon-based algorithm    recent internet-related work    internet measurement algorithm operate    recent approach    node pair    structured way    basic problem    computational limitation    beacon-based approach    internet measurement    networking community    common framework   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University