VoroNet: A scalable object network based on Voronoi tessellations

Olivier Beaumont, Anne-Marie Kermarrec, Loris Marchal & Etienne Rivière

Résumé In this paper, we propose the design of VoroNet, an object-based 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 proves that routing in VoroNet can be achieved in a poly-logarithmic number of hops in the size of the system. The analysis is fully confirmed by our experimental evaluation by simulation.
Citation O. Beaumont, et al., "VoroNet: A scalable object network based on Voronoi tessellations," in IPDPS'07: 21st International Parallel and Distributed Processing Symposium, Long Beach, CA, USA, 2007.
Type Actes de congrès (Anglais)
Nom de la conférence IPDPS'07: 21st International Parallel and Distributed Processing Symposium (Long Beach, CA, USA)
Date de la conférence 13-3-2007
Editeur commercial IEEE
URL http://dx.doi.org/10.1109/IPDPS.2007.370210