Team for Research in
Ubiquitous Secure Technology

Citation
Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer. "Meridian: A Lightweight Network Location Service without Virtual". In Proceedings of The ACM SIGCOMM Conference, Philadelphia, Pennsylvania, August, 2005.

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 largescale 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.

Electronic downloads

• meridian-sigcomm05.pdf · application/pdf · 629 kbytes

• HTML

  Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer. <a
  href="http://www.truststc.org/pubs/58.html"
  >Meridian: A Lightweight Network Location Service without
  Virtual</a>, In Proceedings of The ACM SIGCOMM
  Conference, Philadelphia, Pennsylvania, August, 2005.

• Plain text

  Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer.
  "Meridian: A Lightweight Network Location Service
  without Virtual". In Proceedings of The ACM SIGCOMM
  Conference, Philadelphia, Pennsylvania, August, 2005.

• BibTeX

  @inproceedings{WongSlivkinsSirer05_MeridianLightweightNetworkLocationServiceWithoutVirtual,
      author = {Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer},
      title = {Meridian: A Lightweight Network Location Service
                without Virtual},
      booktitle = {In Proceedings of The ACM SIGCOMM Conference,
                Philadelphia, Pennsylvania},
      month = {August},
      year = {2005},
      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
                largescale 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.},
      URL = {http://www.truststc.org/pubs/58.html}
  }
  

Posted by Bill Hogan on 14 Apr 2006.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.