• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Meridian: A Lightweight Network Location Service without Virtual Coordinates (2005)

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.distcomp.ethz.ch]
  • [dcg.ethz.ch]
  • [disco.ethz.ch]
  • [distcomp.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.cs.cornell.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Bernard Wong , Aleksandrs Slivkins , Emin Gün Sirer
Venue:In SIGCOMM
Citations:103 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Wong05meridian:a,
    author = {Bernard Wong and Aleksandrs Slivkins and Emin Gün Sirer},
    title = {Meridian: A Lightweight Network Location Service without Virtual Coordinates},
    booktitle = {In SIGCOMM},
    year = {2005},
    pages = {85--96}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overlay network structured around multi-resolution rings, query routing with direct measurements, and gossip protocols for dissemination. We show how this framework can be used to address three commonly encountered problems, namely, closest node discovery, central leader election, and locating nodes that satisfy target latency constraints in large-scale distributed systems without having to compute absolute coordinates. We show analytically that the framework is scalable with logarithmic convergence when Internet latencies are modeled as a growthconstrained metric, a low-dimensional Euclidean metric, or a metric of low doubling dimension. Large scale simulations, based on latency measurements from 6.25 million node-pairs as well as an implementation deployed on PlanetLab show that the framework is accurate and effective.

Citations

3028 H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al.
2353 A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1567 Randomized Algorithms - Motwani, Raghavan - 1995
1503 Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
968 A Case for End System Multicast - Chu, Rao, et al. - 2000
928 Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
854 Resilient overlay networks - Andersen, Balakrishnan, et al. - 2001
777 Wide-area cooperative storage with CFS - Dabek, Kaashoek, et al. - 2001
607 Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility - Rowstron, Druschel - 2001
593 Epidemic algorithms for replicated database maintenance - Demers, Greene, et al. - 1988
441 Predicting internet network distance with coordinates-based approaches - NG, ZHANG
422 Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
365 Vivaldi: a decentralized network coordinate system - Dabek, Cox, et al.
250 Topologically-aware overlay construction and server selection - Ratnasamy, Handly, et al. - 2002
234 The end-to-end effects of internet path selection - Savage, Collins, et al. - 1999
219 IDMaps: A Global Internet Host Distance Estimation Service - Francis, Jamin, et al. - 2001
197 Mercury: supporting scalable multi-attribute range queries - Bharambe, Agrawal, et al. - 2004
179 Operating System Support for Planetary-Scale Network Services - Bavier, Bowman, et al.
155 Distributed object location in a dynamic network - Hildrum, Kubiatowicz, et al. - 2002
139 Locating nearby copies of replicated internet servers - Guyton, Schwartz - 1995
135 Estimating latency between arbitrary internet end hosts - King
130 Bounded geometries, fractals, and low-distortion embeddings - Gupta, Krauthgamer, et al. - 2003
129 A Novel Server Selection Technique for Improving the Response Time of a Replicated Service - Fei, Zegura, et al. - 1998
126 Virtual landmarks for the internet - Tang, Crovella - 2003
123 Finding nearest neighbors in growth-restricted metrics - Karger, Ruhl
120 Lighthouses for scalable distributed location - Pias, Crowcroft, et al. - 2003
118 Server selection using dynamic path characterization in wide-area networks - CARTER, CROVELLA - 1997
118 Exploiting Network Proximity in Peer-to-Peer Overlay Networks - Castro, Druschel, et al. - 2002
118 Practical internet coordinates for distance estimation - Costa, Castro, et al. - 2004
110 Spatial gossip and resource location protocols - Kempe, Kleinberg, et al. - 2001
105 Navigating Nets: Simple Algorithms for Proximity Search - Krauthgamer, Lee - 2004
102 Lectures on analysis on metric spaces - Heinonen - 2001
102 The measured performance of content distribution networks - Johnson, Carr, et al. - 2000
99 Big-Bang Simulation for Embedding Network Distances - Shavitt, Tankel
88 Efficient Topology-Aware Overlay Network - Waldvogel, Rinaldi - 2002
85 Constructing internet coordinate system based on delay measurement - Lim, Hou, et al.
79 A Network Positioning System for the Internet - Ng, Zhang - 2004
74 Measured descent: A new embedding method for finite metrics - Krauthgamer, Lee, et al.
69 Plongements lipschitziens dans R n - Assouad - 1983
65 Triangulation and embedding using small sets of beacons - Kleinberg, Slivkins, et al. - 2004
49 Distance estimation and object location via rings of neighbors - Slivkins - 2005
45 Querying peer-to-peer networks using p-trees - CRAINICEANU, LINGA, et al. - 2004
42 Preserving Peer Replicas by Ratelimited Sampled Voting - Maniatis, Rosenthal, et al. - 2003
40 Proximity neighbor selection in tree-based structured peer-to-peer overlays - Castro, Druschel, et al. - 2003
36 Routing Information Organization To Support Scalable Interdomain Routing with Heterogeneous Path Requirements - Hotz - 1996
28 Introspective failure analysis: Avoiding correlated failures in peer-to-peer systems - WEATHERSPOON, MOSCOVITZ, et al.
27 The black-box complexity of nearest neighbor search - Krauthgamer, Lee
26 Backup path allocation based on a correlated link failure probability model in overlay networks - Cui, Stoica, et al. - 2002
26 Distributed approaches to triangulation and embedding - Slivkins - 2005
24 Finding Close Friends on the Internet - Kommareddy, Shankar, et al. - 2001
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2010 The Pennsylvania State University