Sept. 1, 2003 to Sept. 3, 2003
Lakshmish Ramaswamy , Georgia Institute of Technology
Buğra Gedik , Georgia Institute of Technology
Ling Liu , Georgia Institute of Technology
Connectivity based node clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. This paper describes a Connectivity-based Distributed Node Clustering scheme (CDC). This scheme presents a scalable and an efficient solution for discovering connectivity based clusters in peer networks. In contrast to centralized graph clustering algorithms, the CDC scheme is completely decentralized and it only assumes the knowledge of neighbor nodes, instead of requiring a global knowledge of the network (graph) to be available. An important feature of the CDC scheme is its ability to cluster the entire network automatically or to discover clusters around a given set of nodes. We provide experimental evaluations of the CDC scheme, addressing its effectiveness in discovering good quality clusters. Our experiments show that utilizing message-based connectivity structure can considerably reduce the messaging cost, and provide better utilization of resources, which in turn improves the quality of service of the applications executing over decentralized peer-to-peer networks.
Lakshmish Ramaswamy, Buğra Gedik, Ling Liu, "Connectivity Based Node Clustering in Decentralized Peer-to-Peer Networks", P2P, 2003, Peer-to-Peer Computing, IEEE International Conference on, Peer-to-Peer Computing, IEEE International Conference on 2003, pp. 66, doi:10.1109/PTP.2003.1231505