Scalable blind search and broadcasting over Distributed Hash Tables
Computer Communications
Stochastic maintenance of overlays in structured P2P systems
Computer Communications
Building a reliable P2P system out of unreliable P2P clients: the case of KAD
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
DHT performance for peer-to-peer SIP - a mobile phone perspective
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Designing a novel peer-to-peer network
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rollerchain: a DHT for high availability
Proceedings of the Workshop on Posters and Demos Track
| Hi-index | 0.01 |
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 [1] is taken as a case to show the meaningfulness of our analysis.