In this paper, we focus on how neighbor selection impacts DHT overlay structure, static resilience to failures and attacks, and lookup performance under churn. We present a deep comparison study of existing neighbor selection algorithms on the three aspects. We also propose a new neighbor selection policy and a new routing selection 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 selec
Citation:
Yingwu Zhu, Xiaoyu Yang, "Implications of Neighbor Selection on DHT Overlays," mascots, pp.197-206, 14th IEEE International Symposium on Modeling, Analysis, and Simulation, 2006