The design and implementation of a robust, cost-conscious peer-to-peer lookup service

dc.contributor.advisor Blough, Douglas M.
dc.contributor.author Harvesf, Cyrus Mehrabaun en_US
dc.contributor.committeeMember Liu, Ling
dc.contributor.committeeMember Owen, Henry
dc.contributor.committeeMember Riley, George
dc.contributor.committeeMember Yalamanchili, Sudhakar
dc.contributor.department Electrical and Computer Engineering en_US
dc.date.accessioned 2009-01-22T15:45:53Z
dc.date.available 2009-01-22T15:45:53Z
dc.date.issued 2008-11-17 en_US
dc.description.abstract Peer-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.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/26559
dc.publisher Georgia Institute of Technology en_US
dc.subject Internet service providers en_US
dc.subject Routing robustness en_US
dc.subject Replica placement en_US
dc.subject P2P en_US
dc.subject Distributed hash table en_US
dc.subject.lcsh Internet
dc.subject.lcsh Browsers (Computer programs)
dc.subject.lcsh Routing (Computer network management)
dc.subject.lcsh Information retrieval--Computer programs
dc.title The design and implementation of a robust, cost-conscious peer-to-peer lookup service en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Blough, Douglas M.
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 361410e1-2656-48cf-8d91-a4cd3d538c29
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
813.9 KB
Adobe Portable Document Format