Dynamic load sharing in peer-to-peer systems - When some peers are more equal than others

被引：12

作者：

Serbu, Sabina ^{[1
]}

Bianchi, Silvia ^{[1
]}

Kropf, Peter ^{[1
]}

Felber, Pascal ^{[1
]}

机构：

[1] Univ Neuchatel, CH-2000 Neuchatel, Switzerland

来源：

IEEE INTERNET COMPUTING | 2007年 / 11卷 / 04期

关键词：

DHT; Distributed hash tables; Load balancing; P2P; Peer-to-peer; Resource allocation;

D O I：

10.1109/MIC.2007.81

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Object caching and replication are the primary mechanisms for addressing load balancing in peer-to-peer systems. In structured P2P networks, object popularity is an important challenge because it can adversely impact both the request and forwarding loads in the network. To balance loads across P2P networks, the authors propose a method for dynamically updating routing tables to balance the load induced by forwarding traffic in the neighborhood of nodes holding popular objects.

引用

页码：53 / 61

页数：9