The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables

To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly routing lookups. Unfortunately, malicious participants can abuse these responsibilities to deny access to a set of keys or misroute lookups. We look to address both of these problems through replica placement. We present a replica placement scheme for any distributed hash table that uses a prefix-matching routing scheme and evaluate the number of replicas necessary to produce a desired number of disjoint routes. We show through simulation that this placement can make a significant improvement in routing robustness over other placements. Furthermore, we consider another route diversity mechanism that we call neighbor set routing and show that, when used with our replica placement, it can successfully route messages to a correct replica even with a quarter of the nodes in the system failed at random. Finally, ...

• Type: Conference
• Year: 2007
• Where: P2P
• Authors: Cyrus Harvesf, Douglas M. Blough
• Keywords: P2P 2007, Peer-to-Peer Computing, Replica Placement, Replica Placement Scheme, Routing