Implementation of the Distributed Hash Tables on Peer-to-peer Networks

This paper is an examination of the Koorde distributed hash table protocol, "an extension of the Chord protocol" and "a scalable peer-to-peer lookup service" designed to be employed by Internet applications. The Koorde extension uses deBruijn graphs to improve the efficiency of the basic Chord algorithm. The two protocols are described and their basic operation are constructed in Java classes so that their operation may be analyzed and compared using simulations that is developed to roughly represent common communication sessions between peers over the Internet. Simulations are run comparing the hop counts of accessing different numbers of possible nodes and percentages of live nodes using the Chord or its Koorde extension.