• DocumentCode
    2052708
  • Title

    Using incentives to increase availability in a DHT

  • Author

    Picconi, Fabio ; Sens, Pierre

  • Author_Institution
    Lab. d´´Informatique de Paris, France
  • fYear
    2006
  • fDate
    25-29 April 2006
  • 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.
  • Keywords
    cryptography; file organisation; peer-to-peer computing; DHT availability; audit mechanism; data persistence; decentralized storage service; distributed hash tables; incentives-based mechanism; peer-to-peer overlay; quality of service; Aggregates; Availability; Bandwidth; Computer networks; Costs; Joining processes; Large-scale systems; Peer to peer computing; Quality of service; Robustness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International
  • Print_ISBN
    1-4244-0054-6
  • Type

    conf

  • DOI
    10.1109/IPDPS.2006.1639706
  • Filename
    1639706