Chord Implementation using Python

Peer-to-Peer lookup algorithm implemented in Python.
( Distributed Systems Course - Computer Systems Engineering - University of Alaska Anchorage)

In the video, 3 files are inserted on different nodes with ports 27015, 27016, and 27017.

All searches and deletes are done on an arbitrary port (in this case, 27017) to show searching/deleting works.

The MrAnderson.py is to simulate any node of choice running Insert, Delete, or Search. This would normally just happen on the level of the node itself and need to be typed into each respective terminal. But for convenience, this module puts input/output into one terminal and may simulate any node currently up and running.

Referenced: IEEE XPLORE
Chord: a scalable peer-to-peer lookup protocol for Internet applications (2003)

Abstract
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.