GoDel: Delaunay overlays in P2P networks via Gossip

P2P overlays based on Delaunay triangulations have been recently exploited to implement systems providing efficient routing and data broadcast solutions. Several applications such as Distributed Virtual Environments and geographical nearest neighbours selection benefit from this approach. This paper presents a novel distributed algorithm for the incremental construction of a Delaunay overlay in a P2P network. The algorithm employs a distributed version of the classical Edge Flipping procedure. Each peer builds the Delaunay links incrementally by exploiting a random peer sample returned by the underlying gossip level. The algorithm is then optimized by considering the Euclidean distance between peers to speed up the overlay convergence. We present theoretical results that prove the correctness of our approach along with a set of experiments that assess the convergence rate of the distributed algorithm.

[1]  Konrad Iwanicki,et al.  Proactive gossip-based management of semantic overlay networks: Research Articles , 2007 .

[2]  Anne-Marie Kermarrec,et al.  Peer to Peer Multidimensional Overlays: Approximating Complex Structures , 2007, OPODIS.

[3]  Shinichi Ueshima,et al.  Autonomous Generation of Spherical P2P Delaunay Network for Global Internet Applications , 2006, Fourth International Conference on Creating, Connecting and Collaborating through Computing (C5'06).

[4]  Márk Jelasity,et al.  Chord on demand , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[5]  Laura Ricci,et al.  Hivory: Range Queries on Hierarchical Voronoi Overlays , 2010, 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P).

[6]  Simon S. Lam,et al.  Efficient and accurate protocols for distributed delaunay triangulation under churn , 2008, 2008 IEEE International Conference on Network Protocols.

[7]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[8]  Verena Kantere,et al.  Storing and Indexing Spatial Data in P2P Systems , 2009, IEEE Transactions on Knowledge and Data Engineering.

[9]  Márk Jelasity,et al.  T-Man: Gossip-based fast overlay topology construction , 2009, Comput. Networks.

[10]  Moritz Steiner,et al.  Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus , 2009, Networking.

[11]  Jörg Liebeherr,et al.  Application-layer multicasting with Delaunay triangulation overlays , 2002, IEEE J. Sel. Areas Commun..

[12]  Gwendal Simon,et al.  Solipsis: A Massively Multi-Participant Virtual World , 2003, PDPTA.

[13]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[14]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[15]  Jörg Liebeherr,et al.  HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology , 1999, Networked Group Communication.

[16]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[17]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[18]  Konrad Iwanicki,et al.  Proactive gossip‐based management of semantic overlay networks , 2007, Concurr. Comput. Pract. Exp..

[19]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[20]  Kazuyuki Shudo,et al.  Overlay Weaver: An overlay construction toolkit , 2008, Computer Communications.

[21]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[22]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[23]  Manuel Abellanas,et al.  Structural Tolerance and Delaunay Triangulation , 1999, Inf. Process. Lett..

[24]  Shinichi Ueshima,et al.  Incremental construction of Delaunay overlaid network for virtual collaborative space , 2005, Third International Conference on Creating, Connecting and Collaborating through Computing (C5'05).