RootChord

dc.contributor.author	Cwik, Lukasz
dc.date.accessioned	2010-04-29 13:15:49 (GMT)
dc.date.available	2010-04-29 13:15:49 (GMT)
dc.date.issued	2010-04-29T13:15:49Z
dc.date.submitted	2010-04-22
dc.identifier.uri	http://hdl.handle.net/10012/5117
dc.description.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.	en
dc.language.iso	en	en
dc.publisher	University of Waterloo	en
dc.subject	DHT	en
dc.subject	network	en
dc.subject	messaging	en
dc.subject	distributed hash table	en
dc.subject	distributed	en
dc.subject	protocol	en
dc.subject	Chord	en
dc.subject	data structure	en
dc.subject	peer-to-peer	en
dc.subject	P2P	en
dc.subject	peer to peer	en
dc.title	RootChord	en
dc.type	Master Thesis	en
dc.pending	false	en
dc.subject.program	Computer Science	en
uws-etd.degree.department	School of Computer Science	en
uws-etd.degree	Master of Mathematics	en
uws.typeOfResource	Text	en
uws.peerReviewStatus	Unreviewed	en
uws.scholarLevel	Graduate	en