ˇ°Chord: A scalable peer-to-peer lookup service for Internet applicationsˇ±

	Chord is an efficient distributed lookup service. Distributed applications frequently need to locate a specific node. Chord solves this challenging problem in a decentralized manner, thus alleviating the demand for advanced or special hardware. Chord has only 1 operation: given a key, it will find the node corresponding to the key. This single operation is supported by 5 API functions: insert, lookup, update, join and leave. The simple scope of Chord and its simple API functions allows it to be useful to a range of Internet applications. Furthermore, Chord has provided support to allow scalability, dynamism, updatability, concurrent operations and node fault/failure management. These potentials make Chord ideal for any Internet applications that contain large number of nodes, dynamic topology or constant changing node information. 

	The majority of the paper is very technical and requires some existing knowledge of p2p systems. The theoretical and mathematical sections made for slow reading. Much of the data provided is theoretical. It would be interesting to see results from an actual implementation of Chord as described in the paper. In particular, I am interested to see the load balancing capabilities of Chord compared to other centralized or decentralized lookup systems. This paper has discouraged me at making a decentralized system for the project. Concurrency and updatability seem especially difficulty to implement.