CHC: A Robust P2P Overlay Network with Simple Routing and Small-World Features

Abstract

Almost all recent researches on P2P systems focus on how to build a highly usable P2P overlay network. Researchers include small routing table, short query path and good robustness into their design objectives of overlay topology. In this paper, we present a general group theory method and define a new Cayley graph. Based on this Cayley graph, we propose a novel P2P overlay network called CHC, which has simple routing (searching) scheme and many other excellent properties such as short query path, high clustering and good robustness because of its symmetry. The performance is evaluated by simulation to show that CHC possesses shorter query path length and higher clustering and better robustness than several popular P2P overlay networks such as Chord and Ulysses.