RSSN:Super-peers network based on random-walk sampling
Rui Li · Computer Engineering and Applications Journal · 2008
Super-peers P2P network dividing peers into super-peers and leaf-peers sufficiently settled the problem of low resource locating efficiency due to the coexistence of heterogeneous peers.However,traditional super-peer P2P network does not adapt effective methods to build an efficient super-peer layer and adjust super-peers layer according to the high dynamic network situations.A novel efficient super-peer P2P network construction algorithm called RSSN is proposed in this paper.RSSN is based on the random walk sampling algorithm,it chooses more capable peers for preliminary super-peers that can dynamic adjust the super-peers layer according to network conditions. Additionally,through caching index of sharing files in preliminary super-peers,RSSN is capable to adapt to frequent dynamic activities.The simulation evaluation shows that RSSN can dramatically improve the efficience and robust performance of the super-peers P2P network compared with Gnutella0.6.