Peer to Peer Multidimensional Overlays: Approximating Complex Structures

  • Olivier Beaumont
  • Anne-Marie Kermarrec
  • Étienne Rivière
Conference paper

DOI: 10.1007/978-3-540-77096-1_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4878)
Cite this paper as:
Beaumont O., Kermarrec AM., Rivière É. (2007) Peer to Peer Multidimensional Overlays: Approximating Complex Structures. In: Tovar E., Tsigas P., Fouchal H. (eds) Principles of Distributed Systems. OPODIS 2007. Lecture Notes in Computer Science, vol 4878. Springer, Berlin, Heidelberg

Abstract

Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the structure of the application. Peers represent objects of the application so that neighbours in the peer to peer network are objects having similar characteristics from the application’s point of view. Such structured peer to peer overlay networks provide a natural support for range queries. While some complex structures such as a Voronoï tessellation, where each peer is associated to a cell in the space, are clearly relevant to structure the objects, the associated cost to compute and maintain these structures is usually extremely high for dimensions larger than 2.

We argue that an approximation of a complex structure is enough to provide a native support of range queries. This stems from the fact that neighbours are important while the exact space partitioning associated to a given peer is not as crucial. In this paper, we present the design, analysis and evaluation of RayNet, a loosely structured Voronoï-based overlay network. RayNet organizes peers in an approximation of a Voronoï tessellation in a fully decentralized way. It relies on a Monte-Carlo algorithm to estimate the size of a cell and on an epidemic protocol to discover neighbours. In order to ensure efficient (polylogarithmic) routing, RayNet is inspired from the Kleinberg’s small world model where each peer gets connected to close neighbours (its approximate Voronoï neighbours in Raynet) and shortcuts, long range neighbours, implemented using an existing Kleinberg-like peer sampling.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Olivier Beaumont
    • 1
  • Anne-Marie Kermarrec
    • 2
  • Étienne Rivière
    • 2
    • 3
  1. 1.LaBRI/INRIA Futurs, BordeauxFrance
  2. 2.INRIA Rennes Bretagne AtlantiqueFrance
  3. 3.IRISA/Université de Rennes 1France

Personalised recommendations