Community structure in P2P networks

Community structure is a very important property of complex networks. Detecting communities in networks is of great importance in biology, computer science, sociology and so on. In recent years, peer-to-peer (P2P) networks have gained a lot of popularity, but it is still quite difficult to acquire global statistical information. Studying community structure will help researchers use partial statistical information to estimate the global statistical information. This paper reviews some basic concepts, new progress, important algorithms and significant results in the current studies of community structure in P2P networks.

[1]  Shi Zhou,et al.  Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Yong Tang,et al.  A Distributed Hybrid Scheme for Unstructured Peer-to-Peer Networks , 2006, 2006 IEEE International Conference on Communications.

[3]  John Scott.  Social Network Analysis , 1988 .

[4]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[5]  Anne-Marie Kermarrec,et al.  Exploiting semantic clustering in the eDonkey P2P network , 2004, EW 11.

[6]  Partha Dasgupta,et al.  EFFICIENT DISCOVERY OF IMPLICITLY FORMED PEER-TO-PEER COMMUNITIES # , 2002 .

[7]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[8]  Lakshmish Ramaswamy,et al.  A distributed approach to node clustering in decentralized peer-to-peer networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[9]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[10]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[11]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[12]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[13]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[14]  S. N. Dorogovtsev.  Clustering of correlated networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Shi Zhou,et al.  The rich-club phenomenon in the Internet topology , 2003, IEEE Communications Letters.

[16]  Zhang Guoqiang,et al.  Research on Internet Correlation , 2006 .

[17]  Anne-Marie Kermarrec,et al.  Clustering in Peer-to-Peer File Sharing Workloads , 2004, IPTPS.

[18]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Michal Jacovi,et al.  "Ask before you search": peer support and community building with reachout , 2002, CSCW '02.

[21]  Hai Jin,et al.  Identifying Community Structure in Semantic Peer-to-Peer Networks , 2006, SKG.

[22]  Partha Dasgupta,et al.  Structuring Peer-to-Peer Networks Using Interest-Based Communities , 2003, DBISP2P.