Andrew: a distributed personal computing environment
Communications of the ACM - The MIT Press scientific computation series
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Replication in the harp file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Cluster-based file replication in large-scale distributed systems
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
A prototype implementation of archival Intermemory
Proceedings of the fourth ACM conference on Digital libraries
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Creating trading networks of digital archives
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
Data Allocation in a Dynamically Reconfigurable Environment
Proceedings of the Fourth International Conference on Data Engineering
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
Proceedings of the Sixth International Conference on Data Engineering
A Fault Tolerant Replicated Storage System
Proceedings of the Third International Conference on Data Engineering
Towards an Archival Intermemory
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Digital Rosetta Stone: A Conceptual Model for Maintaining Long-term Access to Digital Documents
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 2
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Peer-to-Peer Resource Trading in a Reliable Distributed System
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Mapping data in peer-to-peer systems: semantics and algorithmic issues
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Peer-to-peer research at Stanford
ACM SIGMOD Record
Limited reputation sharing in P2P systems
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Distributed content-based visual information retrieval system on peer-to-peer networks
ACM Transactions on Information Systems (TOIS)
Saving private hypertext: requirements and pragmatic dimensions for preservation
Proceedings of the fifteenth ACM conference on Hypertext and hypermedia
Peer-to-Peer Data Preservation through Storage Auctions
IEEE Transactions on Parallel and Distributed Systems
Ad Hoc, self-supervising peer-to-peer search networks
ACM Transactions on Information Systems (TOIS)
Living with Database Conflicts: A Temporal Branching Technique
Distributed and Parallel Databases
FeedEx: collaborative exchange of news feeds
Proceedings of the 15th international conference on World Wide Web
iDIBS: An Improved Distributed Backup System
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
VXA: a virtual architecture for durable compressed archives
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Pors: proofs of retrievability for large files
Proceedings of the 14th ACM conference on Computer and communications security
Attribute-based access to distributed data over P2P networks
International Journal of Computational Science and Engineering
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Unsupervised creation of small world networks for the preservation of digital objects
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Trading Paper Clips --An Analysis of “Trading Up” in Artificial Societies without Altruists
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Long-term data resilience using opinion polls
Long-term data resilience using opinion polls
Repository replication using NNTP and SMTP
ECDL'06 Proceedings of the 10th European conference on Research and Advanced Technology for Digital Libraries
Storage exchange: a global trading platform for storage services
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Attribute-Based access to distributed data over p2p networks
DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
| Hi-index | 0.00 |
Data archiving systems rely on replication to preserve information. This paper discusses how a network of autonomous archiving sites can trade data to achieve the most reliable replication. A series of binary trades among sites produces a peer-to-peer archiving network. Two trading algorithms are examined, 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). The concept of deeds is introduced; deeds track the blocks of space owned by one site at another. Policies for tuning these algorithms to provide the highest reliability, for example by changing the order in which sites are contacted and offered trades, are discussed. Finally, simulation results are presented that reveal which policies are best. The experiments indicate that a digital archive can achieve the best reliability by trading blocks of space (deeds), and that following certain policies will allow that site to maximize its reliability.