Dynamically Selecting Optimal Distribution Strategies for Web Documents
IEEE Transactions on Computers
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Adaptive Leases: A Strong Consistency Mechanism for the World Wide Web
IEEE Transactions on Knowledge and Data Engineering
IMPROVED INSPECTION SCHEMES FOR DETERIORATING EQUIPMENT
Probability in the Engineering and Informational Sciences
Presence-Based Availability and P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Analytical Study on Improving DHT Lookup Performance under Churn
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
A comparison of hard-state and soft-state signaling protocols
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Long term study of peer behavior in the KAD DHT
IEEE/ACM Transactions on Networking (TON)
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
eDonkey & eMule's Kad: Measurements & Attacks
Fundamenta Informaticae
| Hi-index | 0.00 |
Distributed Hash Tables (DHT) provide a framework for managing information in a large distributed network of nodes. One of the main challenges DHT systems must face is node churn, i.e., nodes can arrive and depart at any time. To assure that information published in a DHT remains available despite node churn is equivalent to building a reliable system out of unreliable components. In this paper we analyze KAD, a widely deployed DHT system. We focus on how to assure that information published in KAD remains available despite churn. We apply reliability theory to understand how the probability of finding an object published in KAD evolves over time. We also evaluate the cost, in terms of message exchanges, associated with the publishing scheme. Once we have identified the main weaknesses of the existing system, we propose an improved publishing scheme that is able to assure the same reliability but at a dramatically reduced cost. By exploiting knowledge about the lifetime of the nodes used to store the information, it is possible to reduce the publishing cost by one order of magnitude.