| Li Wenxiang(李文翔),Guo Chengcheng,Wu Jing.[J].高技术通讯(英文),2011,17(2):126~133 |
|
| A minimal-distance overlay for efficiently disseminating replicas in DHT-based P2P networks |
| |
| DOI： |
| 中文关键词: |
| 英文关键词: peer-to-peer, replication, overlay, redundancy, Chord, k-Medoids clustering |
| 基金项目: |
| Author Name | Affiliation | | Li Wenxiang(李文翔) | | | Guo Chengcheng | | | Wu Jing | |
|
| Hits: 701 |
| Download times: 0 |
| 中文摘要: |
| |
| 英文摘要: |
| In this paper, the problems of redundant traffic and redundant replicas for efficient object replication in P2P overlay are studies. Firstly, a hierarchical and topology-aware P2P overlay is developed with k-Medoids partition algorithm to achieve the minimal physical distance of all super peer pairs. Secondly, a new idea of placing at most one replica in a cluster of physically adjacent nodes is introduced to achieve scattered distribution of replicas. Lastly, an efficient replicas-query algorithm based on multiple hash functions is proposed. Theoretical analysis and simulation experiment on several performance metrics are given, and it is verified that the method in this paper can efficiently disseminate replicas across the network, increase query-hit ratio, and decrease redundant messages and storage spaces required. |
|
View Full Text
View/Add Comment Download reader |
| Close |
|
|
|
