Implications of Neighbor Selection on DHT Overlays

In this paper, we focus on how neighbor selection im-pacts DHT overlay structure, static resilience to failures and attacks, and lookup performance under churn. We present a deep comparison study of existing neighbor se-lection algorithms on the three aspects. We also propose a new neighbor selection policy and a new routing selec-tion algorithm to improve lookup latency under churn. We hope this paper can provide some pieces of insight that will be useful in DHT routing-level designs, including neighbor selection and route selection. 1