Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Scalability and accuracy in a large-scale network emulator
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
MACEDON: methodology for automatically creating, evaluating, and designing overlay networks
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Overlay Weaver: An overlay construction toolkit
Computer Communications
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
Distributed hash tables (DHTs) are one of the hottest topics in large-scale peer-to-peer network research. We propose a method for evaluating DHTs by emulator, which allows us to evaluate not only DHT algorithms but also DHT implementations. Evaluating DHT implementations is important for DHT application developers because their performance influences application design. We developed a DHT emulator that runs in a local environment, and controls several DHT implementations based on a scenario. Because a scenario allows us to repeat evaluations, we can compare DHTs by one scenario and find behavior patterns by slightly changed scenarios. Five use cases are demonstrated to show the capabilities of Peeremu, and some results show DHT characteristics that cannot be obtained by simulating DHT algorithms. We hope this method helps application developers to understand DHTs and utilize them to create a better user experience.