Cooper, Brian and Garcia-Molina, Hector (2001) Peer to peer data trading to preserve information. Technical Report. Stanford.
This is the latest version of this item.
Data archiving systems rely on replication to preserve information. In this paper, we discuss how a network of autonomous archiving sites can trade data to achieve the most reliable replication. A series of binary trades between sites produces a peer to peer archiving network. We examine two trading algorithms, one based on trading collections (even if they are different sizes) and another based on trading equal sized blocks of space (which can then store collections.) We introduce the concept of deeds, which track the sites that own space at other sites. We then discuss policies for tuning these algorithms to provide the highest reliability, for example by changing the order in which sites are contacted and offered trades. Finally, we present simulation results that reveal which policies are most reliable.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||Digital archiving, preservation, data trading, fault tolerance, reliability, distributed systems|
|Subjects:||Computer Science > Digital Libraries|
|Related URLs:||Project Homepage||http://www-diglib.stanford.edu/diglib/pub/|
|Deposited By:||Import Account|
|Deposited On:||21 Feb 2001 16:00|
|Last Modified:||27 Dec 2008 09:45|
Available Versions of this Item
- Peer to peer data trading to preserve information. (deposited 26 Nov 2000 16:00)
- Peer to peer data trading to preserve information. (deposited 21 Feb 2001 16:00) [Currently Displayed]
Repository Staff Only: item control page