Analytical study on improving DHT lookup performance under churn
Refereed conference paper presented and published in conference proceedings

CUHK Authors
Author(s) no longer affiliated with CUHK

Full Text

Times Cited
Web of Science16WOS source URL (as at 15/10/2020) Click here for the latest count

Other information
AbstractThe phenomenon of chum degrades the lookup performance of DHT-based P2P systems greatly. To date, a number of approaches have been proposed to handle it from both the system side and the client side. However there lacks theoretical analysis to direct how to make design choices under different chum levels and how to configure their parameters optimally. In this paper we analytically study three important aspects on improving DHT lookup performance under chum, i.e., lookup strategy, lookup parallelism and lookup key replication. Our objective is to build a theoretical basis for DHT designers to make better design choices in the future. We first compare the performance of two representative lookup strategies - recursive routing and iterative routing, and explore the existence of better alternatives. Then we show the effectiveness of parallel lookup in systems with different chum levels and how to select the optimal degree of parallelism. Due to the importance of key replication on lookup performance, we also analyze the reliability of replicated keys under two different replication policies, and discuss how to make configuration in different environments. Besides analytical study, our results are also validated by simulation, and Kad [1] is taken as a case to show the meaningfulness of our analysis.
All Author(s) ListWu D, Tian Y, Ng KW
Name of Conference6th International Conference on Peer-to-Peer Computing (P2P 2006)
Start Date of Conference06/09/2006
End Date of Conference08/09/2006
Place of ConferenceCambridge
Country/Region of ConferenceGreat Britain
Detailed descriptionorganized by IEEE,
Pages249 - 256
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Theory & Methods; Telecommunications

Last updated on 2020-16-10 at 00:59