|
UWSpace >
University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10012/5117
|
| Title: | RootChord |
| Authors: | Cwik, Lukasz |
| Keywords: | DHT
network
messaging
distributed hash table
distributed
protocol
Chord
data structure
peer-to-peer
P2P
peer to peer |
| Approved Date: | 29-Apr-2010 |
| Date Submitted: | 22-Apr-2010 |
| Abstract: | We present a distributed data structure, which we call "RootChord".
To our knowledge, this is the first distributed hash table which is able to adapt to changes in the size
of the network and answer lookup queries within a guaranteed two hops while maintaining a routing table of size Theta(sqrt(N)).
We provide pseudocode and analysis for all aspects of the protocol including routing, joining, maintaining, and departing the network.
In addition we discuss the practical implementation issues of parallelization, data replication,
remote procedure calls, dead node discovery, and network convergence. |
| Program: | Computer Science |
| Department: | School of Computer Science |
| Degree: | Master of Mathematics |
| URI: | http://hdl.handle.net/10012/5117 |
| Appears in Collections: | Electronic Theses and Dissertations (UW)
Faculty of Mathematics Theses and Dissertations
|
This item is protected by original copyright
|
All items in UWSpace are protected by copyright, with all rights reserved.
|
