Connectedness of a peer-to-peer network is always a critical factor determining the capability of a search algorithm. In a companion paper [4], Sum et al have studied the connectedness property of a Gnutella like network and anticipated that Gnutella might not be a connected network. In view of the important of a connected network in file search, a novel and yet simple peer connection algorithm is proposed in this paper. The essential idea of this algorithm is to allow a new peer node to XTRY two peers instead of one. Then new links are made to them and their neighborhoods. By using Molloy-Reed criteria and a virus outbreak simulation, it is shown that the network being formed by using this new connection algorithm is always a connected network.
展开▼
