ROME: Optimising lookup and load-balancing in DHT-based P2P networks

被引：0

作者：

Salter, J ^{[1
]}

Antonopoulos, N ^{[1
]}

Peel, R ^{[1
]}

机构：

[1] Univ Surrey, Dept Comp, Guildford GU2 5XH, Surrey, England

来源：

PDPTA '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3 | 2005年

关键词：

peer-to-peer; distributed hash tables; Chord; hop count;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Distributed Hash Tables (DHTs) have been used in Peer-to-Peer networks to provide key lookups in typically O(log n) hops whilst requiring maintenance of only small amounts of routing state. We extend ROME, a layer which runs on top of the Chord DHT to provide control over network size through monitoring of node workload and propose the use of processes to reorganise nodes and add or remove them from a pool of available machines. We show this can reduce further the hop counts in networks where available node capacity exceeds workload, without the need to modify any processes of the underlying Chord protocol.

引用

页码：699 / 702

页数：4