A fully distributed peer to peer structure based on 3D Delaunay triangulation

This paper proposes the 3D Delaunay Triangulation (DT ) as a promising solution for constructing scalable p2p networks. The key idea is to maintain for each node a DT of the neighbour nodes. While demonstrating scalability in a real system is not practical for the current work, we demonstrate the scalability of the 3D DT using simulation. The results obtained indicate that there are upper bounds on the time needed to join and on the average number of neighbours maintained by a peer. Therefore, the amount of bandwidth and processing requirement for each node is bound, independent of the total number of nodes in the system.