Paper Info
Title
Balancing access to highly accessed keys in peer-to-peer systems
Abstract
Classical distributed computing projects generally use a specialized client/server model. Recent approaches, such as BOINC, favor instead the development of distributed computing platforms, relying on a generic client/server model. We propose a fully decentralized computing model, considering all participant as peers that can submit personalized computing tasks to any number of other peers currently offering their services, listed in a peer directory. Our model is built upon Chord, a particular distributed hash table. Chord allows load balancing of the number of keys per node, but offers no way to balance the bandwidth load of a frequently accessed key, such as a peer directory. Our model extends Chord with load balancing of those access-intensive keys. We present a modelization of the bandwidth and storage costs of our model and experimental performance results using a variable number of peers, tasks, tasks time, and a variable ratio of contributors and solicitors roles among peers.
Year
DOI
Venue
2004
10.1109/SCC.2004.1358055
Services Computing, 2004.
Keywords
Field
DocType
bandwidth allocation,client-server systems,file organisation,peer-to-peer computing,resource allocation,client-server system,distributed computing,distributed hash table,load balancing,peer directory,peer-to-peer system
Peer-to-peer,Bandwidth allocation,Load balancing (computing),Computer science,Directory,Decentralized computing,Computer network,Resource allocation,Chord (music),Distributed hash table,Distributed computing
Conference
ISSN
ISBN
Citations 
2474-8137
0-7695-2225-4
1
PageRank 
References 
Authors
0.34
6
1
Name
Order
Citations
PageRank
Arnaud Dury120.70