[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2002-22 | ||
| Previous version | 2001-52 | ||
| Submitted on | 29th of March 2002 | ||
| Author | Cooper, Brian F.; Garcia-Molina, Hector | ||
| Title | Bidding for storage space in a peer-to-peer data preservation system (Extended version) | ||
| Date of publication | 2002 | ||
| Published in | Technical Report | ||
| Citation | Cooper, Brian F.; Garcia-Molina, Hector. Bidding for storage space in a peer-to-peer data preservation system (Extended version), Technical Report | ||
| Number of pages | 16 | ||
| Language | English | ||
| Project | Digital Libraries; Peers | ||
| Type | Technical Report | ||
| Subject group | Archival; Digital Libraries; Distributed Systems | ||
| Abstract | Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a cooperative replication network, sites ``trade'' space, so that each site contributes storage resources to the system and uses storage resources at other sites. Here, we examine bid trading: a mechanism where sites conduct auctions to determine who to trade with. A local site wishing to make a copy of a collection announces how much remote space is needed, and accepts bids for how much of its own space the local site must ``pay'' to acquire that remote space. We examine the best policies for determining when to call auctions and how much to bid, as well as the effects of ``maverick'' sites that attempt to subvert the bidding system. Simulations of auction and trading sessio ns indicate that bid trading can allow sites to achieve higher reliability than the alternative: a system where sites trade equal amounts of space without bidding. | ||
| Keywords | distributed storage management, data preservation, archiving, resource trading, auctions, bidding, data replication | ||
| Contact address | cooperb@stanford.edu | ||
| Sponsored by | This material is based upon work supported by the National Science Foundation under Award 9811992. | ||
| Fulltext source |
| Management of the document by | pubs@db.stanford.edu
| |
[ Pagewise preview ]