Interconnected Peer-to-Peer Network: A Community Based Scheme

How to construct an interconnected p2p network is an important task in the dynamical environment. This paper presents a new community-based constructing scheme, which can build an interconnected random peer-to-peer network (RP2P) in an efficient and correct way. The basic unit of RP2P is the logical "community", in which one or more peers join in freely. The peers in different communities collaborate to link all the isolated communities into an interconnected network, which in turn allows the peers to directly or indirectly communicate with each other. In RP2P, each peer can enter or leave the communities at will, thus no extra tasks are imposed on the peer. Furthermore, in this paper the RP2P model is also formally described. In order to show how to construct such RP2P, a community based routing algorithm is advanced and analyzed. According to the formula used to compute the connectivity of RP2P, three factors affect its connectivity: the number of the peers, the number of the communities, and the average number of the communities each peer joins. Moreover, this paper argues that, according to the formula, we can improve the connectivity by the means of increasing the number of the peers and the average number of the communities each peer joins. On the contrary, the connectivity decreases with increasing of the communities. The theoretical analysis shows that our novel scheme can provide an interconnected P2P network.