An analytical study on optimizing the lookup performance of distributed hash table systems under churn
Publication in refereed journal



摘要The phenomenon of system churn degrades the lookup performance of distributed hash table (DHT) systems greatly. To handle the churn, a number of approaches have been proposed to date. However, there is a lack of theoretical analysis to direct how to make design choices under different churn rates and how to configure their parameters optimally. In this paper, we analytically study three important aspects on optimizing DHT lookup performance under churn, i.e. lookup strategy, lookup parallelism and lookup key replication. Our objective is to build a theoretical basis for 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 study the effectiveness of lookup parallelism in systems with different churn rates and show how to select the optimal degree of parallelism. Owing to the importance of key replication on lookup performance, we also analyze the reliability of the replicated key under two different replication policies, and show how to perform proper configuration. Besides the analytical study, our results are also validated by simulation, and Kad is taken as a case to show the meaningfulness of our analysis. Copyright (c) 2007 John Wiley & Sons, Ltd.
著者Wu D, Tian Y, Ng KW
期刊名稱Concurrency and Computation: Practice and Experience
頁次543 - 569
關鍵詞chum; distributed hash table (DHT) system; lookup performance
Web of Science 學科類別Computer Science; Computer Science, Software Engineering; COMPUTER SCIENCE, SOFTWARE ENGINEERING; Computer Science, Theory & Methods; COMPUTER SCIENCE, THEORY & METHODS

上次更新時間 2020-09-07 於 03:43