國立高雄大學圖資館 |

Language: English

Back

Collaborative backup for self-intere...

Cox, Landon P.

Collaborative backup for self-interested hosts.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Collaborative backup for self-interested hosts.
Author:	Cox, Landon P.
Description:	115 p.
Notes:	Chair: Brian D. Noble.
Notes:	Source: Dissertation Abstracts International, Volume: 66-10, Section: B, page: 5493.
Contained By:	Dissertation Abstracts International66-10B.
Subject:	Computer Science.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3192613
ISBN:	9780542364563

Collaborative backup for self-interested hosts.
Cox, Landon P.

Collaborative backup for self-interested hosts. - 115 p.

Chair: Brian D. Noble.

Thesis (Ph.D.)--University of Michigan, 2005.

Because hosts are self-interested, Pastiche is vulnerable to free-loading. If not kept in check, free-loading can collapse the collective. We explore three strategies for eliminating free-loading in Pastiche: bilateral-equal exchange, storage claims, and cyclic exchange.

ISBN: 9780542364563Subjects--Topical Terms:

212513
Computer Science.

Collaborative backup for self-interested hosts.
LDR:03408nmm _2200337 _450 001 170893
005 20061228142314.5
008 090528s2005 eng d
020 $a 9780542364563
035 $a 00242923
040 $a UnM $c UnM
100 0 $a Cox, Landon P. $3 244924
245 1 0 $a Collaborative backup for self-interested hosts.
300 $a 115 p.
500 $a Chair: Brian D. Noble.
500 $a Source: Dissertation Abstracts International, Volume: 66-10, Section: B, page: 5493.
502 $a Thesis (Ph.D.)--University of Michigan, 2005.
520 # $a Because hosts are self-interested, Pastiche is vulnerable to free-loading. If not kept in check, free-loading can collapse the collective. We explore three strategies for eliminating free-loading in Pastiche: bilateral-equal exchange, storage claims, and cyclic exchange.
520 # $a Because hosts can come and go without warning, data is replicated at multiple hosts, called backup buddies. To reduce the cost of replication, users try to identify hosts that already have most of their data so that they only have to send what it is unique to them. This reduces the global storage burden and bandwidth overhead. A study of workstations in the EECS department revealed that for common installations, nodes can expect to find sufficient number of buddies with between 30% and 70% common data.
520 # $a Despite its importance, current approaches to backup are inadequate. Large-scale solutions require aggregation of substantial demand to justify the costs of managing a large, centralized repository. Small-scale solutions require significant administrative effort by the end user.
520 # $a This dissertation presents Pastiche, a low-cost, convenient backup service. Pastiche exploits excess disk capacity to create a peer-to-peer storage collective on independent, untrusted, and self-interested hosts. Costs and inconvenience are kept low by taking advantage of the excess storage capacity provided by individual contributors and through self-organization distributed components.
520 # $a To begin, storage must be allocated through bilateral, equal exchange between hosts. If A stores data on B, B stores an equal amount on A. A can periodically query B to ensure that its data is honored, and vice-versa. If either fails a query, its data is dropped in retaliation.
520 # $a To provide greater data reliability, we can use cyclic exchange . Cyclic exchange provides flexible, fair, and sustainable storage allocation with low network and storage overhead. In cyclic exchange, nodes construct a distributed demand graph based on their preferred storage sites.
520 # $a Unfortunately, bilateral, equal exchange overconstrains storage allocation because it requires a double coincidence of wants between hosts. To enable more flexible allocation, nodes can use storage claims---uncompressible, storage placeholders. Claims are traded for actual data and can be used as a store of value for future exchanges through overwriting and forwarding.
590 $a School code: 0127.
650 # 0 $a Computer Science. $3 212513
650 # 0 $a Economics, General. $3 212429
690 $a 0501
690 $a 0984
710 0 # $a University of Michigan. $3 212464
773 0 # $g 66-10B. $t Dissertation Abstracts International
790 $a 0127
790 1 0 $a Noble, Brian D., $e advisor
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3192613 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3192613