Peer to Peer Multidimensional Overlays: Approximating Complex Structures

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

• Type: Conference
• Year: 2007
• Where: OPODIS
• Authors: Olivier Beaumont, Anne-Marie Kermarrec, Etienne Riviere
• Keywords: Distributed And Parallel Computing, OPODIS 2007, Overlay Network, Such Structured Peer, Voronoi Tessellation