Location of Repository

Using incentives to increase availability in a DHT

By Fabio Picconi, Pierre Sens and Inria Rocquencourt

Abstract

Distributed Hash Tables (DHTs) provide a means to build a completely decentralized, large-scale persistent storage service from the individual storage capacities contributed by each node of the peer-to-peer overlay. However, persistence can only be achieved if nodes are highly available, that is, if they stay most of the time connected to the overlay. In this paper we present an incentives-based mechanism to increase the availability of DHT nodes, thereby providing better data persistence for DHT users. High availability increases a node’s reputation, which translates into access to more DHT resources and a better Quality-of-Service. The mechanism required for tracking a node’s reputation is completely decentralized, and is based on certificates reporting a node’s availability which are generated and signed by the node’s neighbors. An audit mechanism deters collusive neighbors from generating fake certificates to take advantage of the system

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.373.2602
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cecs.uci.edu/~paper... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.