A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A cluster algorithm for graphs
A cluster algorithm for graphs
Connectivity Based Node Clustering in Decentralized Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Selecting a routing strategy for your ad hoc network
Computer Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
A distributed node clustering mechanism in P2P networks
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II
Hi-index | 0.00 |
Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks is still a challenge needs to be addressed. Node clustering is a mechanism that aims to provide an optimal infrastructure to organize the nodes in a P2P network. This paper describes an approach to implement node clustering based on link delay of node communications in the P2P network. This approach is completely distributed, in which each node only depends on its neighbors to implement node clustering. In this approach, we propose two distributed algorithms: T-closure algorithm and hierarchical node clustering algorithm to find node clusters automatically in a P2P network. We explore the node connectivity together with the connection quality. As a result, the link delay of communication between the super-node and the peer-node in node clustering can be limited, which will improve the overall performance of P2P networks.