Analytical Study on Improving DHT Lookup Performance under Churn
Di Wu
Ye Tian
Kam-Wing Ng
Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong;
This paper appears in: Peer-to-Peer Computing, 2006. P2P 2006. Sixth IEEE International Conference on
Publication Date: 6-8 Sept. 2006
On page(s): 249-258
Location: Cambridge,
ISBN: 0-7695-2679-9
INSPEC Accession Number: 9123826
Digital Object Identifier: 10.1109/P2P.2006.4
Current Version Published: 2006-10-16
Abstract
The phenomenon of churn 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 churn levels and how to configure their parameters optimally. In this paper, we analytically study three important aspects on improving DHT lookup performance under churn, 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 churn 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 is taken as a case to show the meaningfulness of our analysis
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
