Trust-based supernode selection in peer-to-peer systems

The P2P applications employing supernode architecture become more and more popular, while the problem about supernode selection is still open. When selecting supernodes, current researches and application fields mainly focus on the capability criterion such as software and hardware. So this provides malicious node with a good chance to exert malicious behaviors because they can seriously damage the system by upgrading their capability to become supernodes. This paper presents a new trust-based supernode selection method that is complementary to the only-capability selection. We use the concept of proxy trust to identify the behaviors of supernodes. With this metric a peer can select its own trusted supernodes and isolate malicious supernodes in the system. Furthermore in order to reduce network cost, we do not adopt basic flooding mechanism, but a limited one to distribute the trusted supernodes list requests. Simulations show our method can isolate malicious supernodes within a rather short period and greatly improve the probability of successful services. At the same time network overhead is small in our method.

[1]  Ben Y. Zhao,et al.  Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.

[2]  Jie Lu,et al.  Content-based retrieval in hybrid peer-to-peer networks , 2003, CIKM '03.

[3]  P. Garbacki.  Applying the Super-Peer Concept to Existing Peer-to-Peer Content Sharing Networks , 2003 .

[4]  Magnus Karlsson,et al.  Turning heterogeneity into an advantage in overlay routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Zhiyong Xu,et al.  SBARC: A supernode based peer-to-peer file sharing system , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[6]  Daeyeon Park,et al.  A lightweight personal grid using a supernode network , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[7]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[8]  Alberto Montresor,et al.  A robust protocol for building superpeer overlay topologies , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[9]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[10]  Mohamed A. Soliman,et al.  A Survey of Data Management in Peer-to-Peer Systems , 2005 .

[11]  Jun Li,et al.  Scalable supernode selection in peer-to-peer overlay networks , 2005 .

[12]  Li Xiao,et al.  Differentiated search in hierarchical peer-to-peer networks , 2005, 2005 International Conference on Parallel Processing (ICPP'05).

[13]  Li Xiao,et al.  Dynamic Layer Management in Superpeer Architectures , 2005, IEEE Trans. Parallel Distributed Syst..

[14]  Ralf Ackermann,et al.  Security-Related Issues in Peer-to-Peer Networks , 2005, Peer-to-Peer Systems and Applications.

[15]  Calton Pu,et al.  Constructing a proximity-aware power law overlay network , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[16]  Kasmiran Jumari,et al.  2009 International Conference on Future Computer and Communication , 2009 .