Route Diversity in Tree Based Distributed Hash Tables
Hash tables - which map "Keys" onto "Values" - are an essential building block in modern software systems. Nodes can deny access to keys or misroute lookups. In this paper address both of these problems through replica placement. Replica placement that creates route diversity for these DHTs. Using simulations of Pastry (a tree-based routing DHT), the impact of MAXDISJOINT on routing robustness compared to other placements when nodes are compromised at random or in a contiguous runs are evaluated. Replica query strategies that can trade off response time and system load. A hybrid query strategy that keeps response time low without producing too high a load.