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.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OWTU.10012/5117 |
| Date | 22 April 2010 |
| Creators | Cwik, Lukasz |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
Page generated in 0.0017 seconds