Meridian: a lightweight network location service without virtual coordinates Export

@inproceedings{citeulike:546697, 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 growth-constrained 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.}, address = {New York, NY, USA}, author = {Wong, Bernard and Slivkins, Aleksandrs and Sirer, Emin G.}, booktitle = {SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications}, citeulike-article-id = {546697}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1080091.1080103}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1080091.1080103}, doi = {10.1145/1080091.1080103}, isbn = {1-59593-009-4}, issn = {0146-4833}, keywords = {latency, location-service, overlay-network, p2p, peer-to-peer}, location = {Philadelphia, Pennsylvania, USA}, month = {October}, number = {4}, pages = {85--96}, posted-at = {2009-11-05 14:23:54}, priority = {2}, publisher = {ACM}, title = {Meridian: a lightweight network location service without virtual coordinates}, url = {http://dx.doi.org/10.1145/1080091.1080103}, volume = {35}, year = {2005} }

TY - CONF ID - citeulike:546697 L3 - citeulike-article-id:546697 N2 - 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 growth-constrained 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. CY - Philadelphia, Pennsylvania, USA IS - 4 SN - 1-59593-009-4 AD - New York, NY, USA EP - 96 TI - Meridian: a lightweight network location service without virtual coordinates PB - ACM VL - 35 T2 - SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications SP - 85 KW - latency KW - location-service KW - overlay-network KW - p2p KW - peer-to-peer AU - Wong, Bernard AU - Slivkins, Aleksandrs AU - Sirer, Emin PY - 2005/10// UR - http://dx.doi.org/10.1145/1080091.1080103 ER -