UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

RootChord

Thumbnail Image

Files

Cwik_Lukasz.pdf (513.93 KB)

Date

2010-04-29T13:15:49Z

Authors

Cwik, Lukasz

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

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.

Description

Keywords

DHT, network, messaging, distributed hash table, distributed, protocol, Chord, data structure, peer-to-peer, P2P, peer to peer

LC Keywords

Citation

URI

http://hdl.handle.net/10012/5117

Collections

Theses
Computer Science