|
When:
Wednesday, May 04, 10:30 p.m.
Where: Intel Research Pittsburgh, 4720 Forbes Avenue, Suite 410 Other
Landon Cox, Computer Science and Engineering, University of Michigan
Intel Research Pittsburgh Seminar
Abstract: The cost and inconvenience of backup are unavoidable and often prohibitive. 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.
Pastiche is a low-cost, administration-free backup service that eases this tension. Pastiche copies users' backup state into a decentralized, peer-to-peer storage pool composed of volunteered, excess disk space. Each node in the collective is independent, untrusted, and unreliable.
Pastiche replicates data at multiple sites so that at least one copy of
the data is available at all times with very high probability.
This talk will focus on two of the biggest challenges faced by
Pastiche: the bandwidth required to create replicas and the incentives
needed to encourage participants to contribute storage. Pastiche reduces
bandwidth consumption by choosing replica sites based on the amount of
overlapping inter-disk data. To bind consumption to contribution, Pastiche
imposes a "tit-for-tat" exchange protocol and exploits cyclic demand among peers to allocate storage.
Landon Cox is a 6th year Ph.D student in Computer Science and Engineering at The University of Michigan under Brian Noble. He received his M.S. from Michigan in 2001, and B.S. degrees in Computer Science and Mathematics from Duke University in 1999. His research interests are distributed systems and operating systems.
<< Back
|