VoroNet: A scalable object network based on Voronoi tessellations

In this paper, we propose the design of VoroNet, an objectbased peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation. VoroNet differs from previous overlay networks in that peers are application objects themselves and get identifiers reflecting the semantics of the application instead of relying on hashing functions. This enables a scalable support for efficient search in large collections of data. In VoroNet, objects are organized in an attribute space according to a Voronoi diagram. VoroNet is inspired from the Kleinberg’s small-world model where each peer gets connected to close neighbours and maintains an additional pointer to a long-range neighbour. VoroNet improves upon the original proposal as it deals with general object topologies and therefore copes with skewed data distributions. We show that VoroNet can be built and maintained in a fully decentralized way. The theoretical analysis of the system ...

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Olivier Beaumont, Anne-Marie Kermarrec, Loris Marchal, Etienne Riviere
• Keywords: Distributed And Parallel Computing, IPPS 2007, Overlay Networks, Theoretical Analysis, VoroNet