A computational study of graph partitioning
Mathematical Programming: Series A and B
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Clustering in large graphs and matrices
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
ACM Computing Surveys (CSUR)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
GD '96 Proceedings of the Symposium on Graph Drawing
Graph Clustering Using Multiway Ratio Cut
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Connectivity-Based k-Hop Clustering in Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
PeerCQ: A Decentralized and Self-Configuring Peer-to-Peer Information Monitoring System
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Performance criteria for graph clustering and Markov cluster experiments
Performance criteria for graph clustering and Markov cluster experiments
A new cluster algorithm for graphs
A new cluster algorithm for graphs
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
iVIBRATE: Interactive visualization-based framework for clustering large datasets
ACM Transactions on Information Systems (TOIS)
Ontology-Based Service Representation and Selection
IEEE Transactions on Knowledge and Data Engineering
Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks
Mobile Networks and Applications
GrouPeer: Dynamic clustering of P2P databases
Information Systems
On the reliability of large-scale distributed systems - A topological view
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Towards a society of peers: expert and interest groups in peer-to-peer systems
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
Traffic-based network clustering
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
GROUP: a gossip based building community protocol
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Pythia: a privacy aware, peer-to-peer network for social search
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
A Read-Only Distributed Hash Table
Journal of Grid Computing
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
SDC: a distributed clustering protocol for peer-to-peer networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
A scatternet formation algorithm for Bluetooth networks with a non-uniform distribution of devices
Journal of Network and Computer Applications
Spreading activation model for connectivity based clustering
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Journal of Computer and System Sciences
Hi-index | 0.00 |
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 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. To cope with the typical dynamics of P2P networks, we provide mechanisms to allow new nodes to be incorporated into appropriate existing clusters and to gracefully handle the departure of nodes in the clusters. These mechanisms enable the CDC scheme to be extensible and adaptable in the sense that the clustering structure of the network adjusts automatically as nodes join or leave the system. We provide detailed experimental evaluations of the CDC scheme, addressing its effectiveness in discovering good quality clusters and handling the node dynamics. We further study the types of topologies that can benefit best from the connectivity-based distributed clustering algorithms like CDC. 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.