Efficient Broadcast on Area of Interest in Voronoi Overlays

This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-to-peer network. The proposed algorithm is an advanced version of the Compass Routing algorithm, and it is able to guarantee the delivery of 100% of the packets, while minimizing the total number of packets that travel the network. The algorithm has been theoretically analyzed, and it has been implemented on a proof of concept peer-to-peer application, and experimental results show that the algorithm actually respects the reduced number of total packets used, as per the theoretical analysis.

[1]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[2]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[3]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[4]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[5]  Herbert Edelsbrunner,et al.  Incremental topological flipping works for regular triangulations , 1992, SCG '92.

[6]  Shun-Yun Hu,et al.  VON: a scalable peer-to-peer network for virtual environments , 2006, IEEE Network.

[7]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[8]  Laura Ricci,et al.  AOI-Cast Strategies for P2P Massively Multiplayer Online Games , 2009, 2009 6th IEEE Consumer Communications and Networking Conference.

[9]  Anne-Marie Kermarrec,et al.  VoroNet: A scalable object network based on Voronoi tessellations , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[10]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

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

[12]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[13]  Tim Moors,et al.  Survey of research towards robust peer-to-peer networks: Search methods , 2006, Comput. Networks.

[14]  Farnoush Banaei Kashani,et al.  SWAM: a family of access methods for similarity-search in peer-to-peer data networks , 2004, CIKM '04.

[15]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[16]  Domenico Talia,et al.  Peer-to-Peer resource discovery in Grids: Models and systems , 2007, Future Gener. Comput. Syst..

[17]  Laura Ricci,et al.  VoRaQue: Range queries on Voronoi overlays , 2008, 2008 IEEE Symposium on Computers and Communications.

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