Three-Tier Delaunay Network as a Topology for Peer-to-Peer Overlay

Abstract

This paper considers the problem of improving the routing performance of hierarchical Delaunay networks. Delaunay network is a network topology for peer-to-peer systems based on the Delaunay triangulation of a set of points associated with a set of peers. It is known that Delaunay networks have a favorable property as a topology for peer-to-peer systems such that a greedy routing scheme always delivers a given message to its destination without encountering a dead-end. The key idea used in the proposed method is to apply a hash function to the address of participant peers. More concretely, by applying a hash function to the coordinate point of the peers and by associating several points to each peer, we could realize an overlay so that the number of hops to the destination in the original network could be significantly reduced.