Name
Abstract | ||
|---|---|---|
A P2P network is an important computing model because of its scalability, adaptability, self-organization, etc. How to organize the nodes in P2P networks effectively is an important research issue. The node clustering aims to provide an effective method to organize the nodes in P2P networks. This paper proposes a distributed node clustering mechanism based on nodes' queries in P2P networks. In this mechanism, we propose three algorithms: maintaining of node clusters, merging of node clusters and splitting of node clusters. Theoretical analysis shows the time and communication complexity of this clustering mechanism is low. Simulation results show that the clustering accuracy of this clustering mechanism is high. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-17313-4_57 | ADMA (2) |
Keywords | Field | DocType |
node clustering,important research issue,important computing model,p2p network,effective method,node cluster,communication complexity,node clustering mechanism,clustering accuracy,clustering mechanism,self organization,computer model | Adaptability,Cluster (physics),Correlation clustering,Computer science,Computer network,Communication complexity,Cluster analysis,Ring network,Kademlia,Distributed computing,Scalability | Conference |
Volume | ISSN | ISBN |
6441 | 0302-9743 | 3-642-17312-8 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mo Hai | 1 | 1 | 2.74 |
| Shuhang Guo | 2 | 0 | 0.34 |