Peer-to-peer computing in distributed hash table models using a consistent hashing extension for access-intensive keys

Authors:
Arnaud Dury
Affiliations:
Centre de Recherche en Informatique de Montréal, Montréal, Québec, Canada
Venue:
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Year:
2004

Citing 4
Cited 0

Distributed LTL model-checking in SPIN

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Protecting Free Expression Online with Freenet

IEEE Internet Computing
Novel architectures for P2P applications: the continuous-discrete approach

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
evolution@home: Experiences with Work Units That Span More than 7 Orders of Magnitude in Computational Complexity

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

Quantified Score

Hi-index	0.00

Visualization

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.