creator Velani, Hussain advisor Anjali, Tricha The Content Addressable Network is a decentralized Distributed Hash Table for peer-to-peer networks that is scalable and fault tolerant. CAN is capable of performing dynamic node operations. CAN assumes a virtual d-dimensional coordinate system where the entire coordinate space is divided into zones. Each node in CAN is assigned a zone. CAN maps the key-value pair to a point in the virtual coordinate space. Each node maintains a specific number of key value pairs based on the coordinates of the zone. Each node also maintains a limited amount of information about its neighbors. This neighbor information is used for routing in CAN. Routing in CAN is based on a Virtual Identifier. This Virtual Identifier is provided to a node when it joins the CAN. Hence the routing is defined in terms of application hops. In this thesis, the concepts behind the joining are explained. Concepts employed for departure of nodes are discussed. Simulation for departure is explained and the results are discussed. Idea for implementation of handling failure of nodes is discussed and possible future work is highlighted. Submitted by Liana Khananashvili (khananashvili@iit.edu) on 2013-08-20T21:10:03Z No. of bitstreams: 1 Hussain_Thesis_Masters.pdf: 571715 bytes, checksum: 3ae8db78983b1ab9ed92492f28f11b3f (MD5) Made available in DSpace on 2013-08-20T21:10:03Z (GMT). No. of bitstreams: 1 Hussain_Thesis_Masters.pdf: 571715 bytes, checksum: 3ae8db78983b1ab9ed92492f28f11b3f (MD5) Previous issue date: 2012-12 M.S. in Electrical Engineering, December 2012 2012-11-26 2012-12 http://hdl.handle.net/10560/3045 en Thesis born digital application/pdf In Copyright http://rightsstatements.org/page/InC/1.0/ Restricted Access ECE / Electrical and Computer Engineering Illinois Institute of Technology Affiliated department