Show simple item record

dc.contributor.authorCwik, Lukasz
dc.date.accessioned2010-04-29 13:15:49 (GMT)
dc.date.available2010-04-29 13:15:49 (GMT)
dc.date.issued2010-04-29T13:15:49Z
dc.date.submitted2010-04-22
dc.identifier.urihttp://hdl.handle.net/10012/5117
dc.description.abstractWe 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.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectDHTen
dc.subjectnetworken
dc.subjectmessagingen
dc.subjectdistributed hash tableen
dc.subjectdistributeden
dc.subjectprotocolen
dc.subjectChorden
dc.subjectdata structureen
dc.subjectpeer-to-peeren
dc.subjectP2Pen
dc.subjectpeer to peeren
dc.titleRootChorden
dc.typeMaster Thesisen
dc.comment.hiddenFinally finished awesomenessen
dc.pendingfalseen
dc.subject.programComputer Scienceen
uws-etd.degree.departmentSchool of Computer Scienceen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages