A density-based approach to node clustering in decentralized peer-to- peer networks

Efficient organization of the nodes in decentralized peer-to-peer (P2P) networks is a challenging problem, especially in the absence of a global schema. Node clustering is an available way to optimize infrastructure and decrease traffic cost in P2P networks. This paper proposes a Density-based Distributed Node Clustering (DDNC) approach to discovering clusters in P2P networks. This approach is completely distributed, in which each node only depends on the knowledge of its neighbors for node clustering. Unlike other graph based algorithms, the DDNC approach utilizes density of node's neighbor for discovering clusters. For a given node, the DDNC determines its neighbor density by computing the link time with its neighbors, which not only considers the node connectivity but also connection quality. The DDNC scheme can also dynamically adapt its clusters according to the participation and departure of nodes. Experimental results have shown ours scheme's feasibility and efficiency.

[1]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[3]  Eric A. Brewer,et al.  Cluster-based scalable network services , 1997, SOSP.

[4]  Arunabha Sen,et al.  Graph Clustering Using Multiway Ratio Cut , 1997, GD.

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  Ka Boon Ng,et al.  Peer Clustering and Firework Query Model , 2002 .

[7]  Fillia Makedon,et al.  Node clustering based on link delay in P2P networks , 2005, SAC '05.

[8]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[9]  Christian Bettstetter,et al.  Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm , 2001, MobiHoc.

[10]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[11]  Arne Frick,et al.  Automatic Graph Clustering , 1996, GD.

[12]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[13]  S. Dongen.  A new cluster algorithm for graphs , 1998 .

[14]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[15]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[16]  Franz Rendl,et al.  A computational study of graph partitioning , 1994, Math. Program..

[17]  Daniel A. Keim,et al.  An Efficient Approach to Clustering in Large Multimedia Databases with Noise , 1998, KDD.

[18]  Alan M. Frieze,et al.  Clustering in large graphs and matrices , 1999, SODA '99.

[19]  Hector Garcia-Molina,et al.  YAPPERS: a peer-to-peer lookup service over arbitrary topology , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Song Jiang,et al.  LightFlood: an efficient flooding scheme for file search in unstructured peer-to-peer systems , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..

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