Hierarchical Delaunay Network for Peer-to-Peer Overlay with Address Hashing

Abstract

This paper proposes a method to improve the routing performance of hierarchical Delaunay networks. Delaunay network is a network topology for peer-to-peer systems which is based on the Delaunay triangulation of point set associated with the set of peers. It has 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. The key idea of 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, we could realize an overlay so that the number of hops to the destination in the original network could be effectively reduced.