Show simple item record

dc.contributor.authorHarvesf, Cyrus Mehrabaunen_US
dc.date.accessioned2009-01-22T15:45:53Z
dc.date.available2009-01-22T15:45:53Z
dc.date.issued2008-11-17en_US
dc.identifier.urihttp://hdl.handle.net/1853/26559
dc.description.abstractPeer-to-peer (p2p) technology provides an excellent platform for the delivery of rich content and media that scales with the rapid growth of the Internet. This work presents a lookup service design and implementation that provides provable fault tolerance and operates in a cost-conscious manner over the Internet. <br><br> Using a distributed hash table (DHT) as a foundation, we propose a replica placement that improves object availability and reachability to implement a robust lookup service. We present a framework that describes tree-based routing DHTs and formally prove several properties for DHTs of this type. Specifically, we prove that our replica placement, which we call MaxDisjoint, creates a provable number of disjoint routes from any source node to a replica set. We evaluate this technique through simulation and demonstrate that it creates disjoint routes more effectively than existing replica placements. Furthermore, we show that disjoint routes have a marked impact on routing robustness, which we measure as the probability of lookup success. <br><br> To mitigate the costs incurred by multi-hop DHT routing, we develop an organization-based id assignment scheme that bounds the transit costs of prefix-matching routes. To further reduce costs, we use MaxDisjoint placement to create multiple routes of varying costs. This technique helps reduce cost in two ways: (1) replication may create local copies of an object that can be accessed at zero transit cost and (2) MaxDisjoint replication creates multiple, bounded cost, disjoint routes of which the minimal cost route can be used to resolve the lookup. We model the trade-off between the storage cost and routing cost benefit of replication to find the optimal degree to which an object should be replicated. We evaluate our approach using a lookup service implementation and show that it dramatically reduces cost over existing DHT implementations. Furthermore, we show that our technique can be used to manage objects of varying popularity in a manner that is more cost effective than caching. <br><br> By improving its robustness and cost effectiveness, we aim to increase the pervasiveness of p2p in practice and unlock the potential of this powerful technology.en_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectInternet service providersen_US
dc.subjectRouting robustnessen_US
dc.subjectReplica placementen_US
dc.subjectP2Pen_US
dc.subjectDistributed hash tableen_US
dc.subject.lcshInternet
dc.subject.lcshBrowsers (Computer programs)
dc.subject.lcshRouting (Computer network management)
dc.subject.lcshInformation retrieval--Computer programs
dc.titleThe design and implementation of a robust, cost-conscious peer-to-peer lookup serviceen_US
dc.typeDissertationen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.advisorCommittee Chair: Blough, Douglas; Committee Member: Liu, Ling; Committee Member: Owen, Henry; Committee Member: Riley, George; Committee Member: Yalamanchili, Sudhakaren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record