| dc.contributor.advisor | Kak, Subhash C. | |
| dc.contributor.author | Peruru,l Sravanthi | |
| dc.date.accessioned | 2014-04-15T18:33:08Z | |
| dc.date.available | 2014-04-15T18:33:08Z | |
| dc.date.issued | 2010-07-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/8222 | |
| dc.description.abstract | A central problem faced in distributed data storage and in peer to peer applications is the efficient location of the node where the requested data is present. Currently popular peer to peer protocols such as Chord and Gnutella require enormous overhead. In Chord protocol data needs to be moved back and forth in order to stabilize the network and in Gnutella the requests flood the network. The above problems call for an efficient and reliable addressing scheme. The protocol proposed in this thesis (CHORELLA) can accommodate a maximum of 220 nodes in the network. It takes just one hop to find any file in the network and in case of node failures, it may take a maximum of as many hops as the number of mirrors or the replication rate in the network. The files are evenly distributed among the nodes using SHA-1 hashing function. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Reliable and Scalable Addressing Scheme for Data Distribution | |
| dc.type | text | |
| dc.contributor.committeeMember | Thomas, Johnson | |
| dc.contributor.committeeMember | Toulouse, Michel | |
| osu.filename | Peruru_okstate_0664M_11037.pdf | |
| osu.college | Arts and Sciences | |
| osu.accesstype | Open Access | |
| dc.description.department | Computer Science Department | |
| dc.type.genre | Thesis | |
