Document - GoDel: Delaunay overlays in P2P networks via Gossip

2012

Conference article Open Access

GoDel: Delaunay overlays in P2P networks via Gossip

Baraglia R., Dazzi P., Guidi B., Ricci L.

Gossip Delaunay Peer-to-Peer

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.

Source: 12th IEEE International Conference on Peer-to-Peer Computing, pp. 1–12, Tarragona, Spain, September 3-5, 2012

Publisher: IEEE Computer Society Press, Loa Alamitos [CA], USA

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:212313,
	title = {GoDel: Delaunay overlays in P2P networks via Gossip},
	author = {Baraglia R. and Dazzi P. and Guidi B. and Ricci L.},
	publisher = {IEEE Computer Society Press, Loa Alamitos [CA], USA},
	doi = {10.1109/p2p.2012.6335800},
	booktitle = {12th IEEE International Conference on Peer-to-Peer Computing, pp. 1–12, Tarragona, Spain, September 3-5, 2012},
	year = {2012}
}