Abstract:

As the existing P2P overlay networks can not closely connect peers with the same interest together, it is not practical to provide browsing service in such systems. In order to solve this problem, the existing cube-connected cycle （CCC） graph is generalized, and the topological properties of the generalized CCC （GCCC） graph are in- vestigated. Afterwards, a novel structured P2P overlay network marked as GCNET （Generalized Cube-Connected Cycle network） is defined based on GCCC, which possesses better small-world characteristics and stronger robust- ness than other P2P overlay networks. Simulated results show that GCNET can reach the theoretical lower bounds of both the routing table size and the query path length.

Key words: file browsing, P2P overlay network, cube-connected cycle, generalized cube-connected cycle net-work, Cayley graph, small-world characteristic , robustness