BGKR: A Novel P2P Network Based on Generalized Kautz and Ring with Constant Congestion

The topological properties of Peer-to-Peer (P2P) overlay networks are critical factors that dominate the performance of these systems. The P2P networks need a topology with arbitrary size and degree, while the Kautz digraph is a topology with good properties such as constant degree and optimal network diameter O(log
_d
N). However, the limitation of the Kautz digraph is its poor degree of extension. In this paper, we propose a novel P2P network with constant degree which is based on generalized Kautz digraph and the ring (BGKR). Resources are located by using a slightly modified approach of the distributed hash table (DHT) concept. Each data item is looked up on a set of nodes sharing the same prefix with key associated to that data item. This can be exploited for preserving load balancing in the network. Each node maintains a maximum limited number of 2d +1 entries in its routing table, and routing between any two nodes in BGKR can achieved in at most log
_d
(((N(d-1))/d+1)+1) hops. The routing length of BGKR is shorter than KZCAN and D2B with the same degree when the P2P network is large scale.