Social Network Analysis on KAD and Its Application

In recent years, peer-to-peer (P2P) file sharing applications (e.g., eMule) have dominated the Internet. eMule deploys its distributed network (i.e., KAD) based on Kademlia, a robust distributed hash table (DHT) protocol, to facilitate the delivery of content. In this paper, we conduct a series of analyses on the social network of KAD which is formed based on the information of how peers share files in KAD. Our analyses reveal many interesting characteristics of KAD. We further discuss the uses and misuses of these characteristics. Especially, we propose a novel approach to improve the routing performance of KAD based on the characteristic of its community structure.

[1]  Partha Dasgupta,et al.  Peer-to-peer Communities: Formation and Discovery , 2002, IASTED PDCS.

[2]  Kun Liu,et al.  Client-side web mining for community formation in peer-to-peer environments , 2006, SKDD.

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Michalis Faloutsos,et al.  Transport layer identification of P2P traffic , 2004, IMC '04.

[5]  Michael Kaminsky,et al.  SybilGuard: defending against sybil attacks via social networks , 2008, TNET.

[6]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[7]  Kam-Wing Ng,et al.  Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Peter Druschel,et al.  Peer-to-peer systems , 2010, Commun. ACM.

[10]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.