PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Baraglia R., Dazzi P., Guidi B., Ricci L. GoDel: Delaunay overlays in P2P networks via Gossip. In: P2P 2012 - IEEE 12th International Conference on Peer-to-Peer Computing (Tarragona, Spain, 3 - 5 September 2012). Proceedings, pp. 1 - 12. (IEEE International Conference on Peer-to-Peer Computing). IEEE, 2012.
 
 
Abstract
(English)
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.
DOI: 10.1109/P2P.2012.6335800
Subject Peer-to-Peer
Delaunay
Gossip
C.2.1


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional