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

Abstract

Recent peer-to-peer (P2P) systems research has focused on building highly usable P2P overlay networks. Short query paths, small routing tables, and robustness constitute the most prominent design objectives for the overlay topology. In this paper, we introduce a general group theoretic method and define a new Cayley graph. We then use these constructs to derive a novel P2P overlay structure. CayleyCCC, our proposed overlay network, has many desirable features, including short query paths, compact routing tables, high clustering, and robustness. Because of its symmetry, our design offers simpler routing (searching) and several other desirable properties compared with many previously proposed overlay networks, such as Chord and Ulysses. Performance evaluation results, reported in this paper, quantify the advantages of CayleyCCC in terms of query path length, routing table size, and robustness relative to some recent proposals. CayleyCCC is particularly useful in distributed computing under relatively stable conditions.