Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Buckets: smart objects for digital libraries
Communications of the ACM
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Peer-to-peer data trading to preserve information
ACM Transactions on Information Systems (TOIS)
Maintenance-Free Global Data Storage
IEEE Internet Computing
An end-to-end approach to globally scalable network storage
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ECDL '02 Proceedings of the 6th European Conference on Research and Advanced Technology for Digital Libraries
DSpace: An Institutional Repository from the MIT Libraries and Hewlett Packard Laboratories
ECDL '02 Proceedings of the 6th European Conference on Research and Advanced Technology for Digital Libraries
MySRB & SRB: Components of a Data Grid
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
A semi-automated digital preservation system based on semantic web services
Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries
The LOCKSS peer-to-peer digital preservation system
ACM Transactions on Computer Systems (TOCS)
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
aDORe: A Modular, Standards-Based Digital Object Repository
The Computer Journal
A framework for distributed digital object services
International Journal on Digital Libraries
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Factors affecting website reconstruction from the web infrastructure
Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries
Unsupervised creation of small world networks for the preservation of digital objects
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Unsupervised creation of small world networks for the preservation of digital objects
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Analysis of graphs for digital preservation suitability
Proceedings of the 21st ACM conference on Hypertext and hypermedia
A unique arrangement: organizing collections for digital libraries, archives, and repositories
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
| Hi-index | 0.00 |
The prevailing model for digital preservation is that archives should be similar to a "fortress": a large, protective infrastructure built to defend a relatively small collection of data from attack by external forces. Such projects are a luxury, suitable only for limited collections of known importance and requiring significant institutional commitment for sustainability. In previous research, we have shown the web infrastructure (i.e., search engine caches, web archives) refreshes and migrates web content in bulk as side-effects of their user-services, and these results can be mined as a useful, but passive preservation service. Our current research involves a number of questions resulting from removing the implicit assumption that web-based data objects must passively await curatorial services: What if data objects were not tethered to repositories? What are the implications if the content were actively seeking out and injecting itself into the web infrastructure (i.e., search engine caches, web archives)? All of this leads to our primary research question: Can we create objects that preserve themselves more effectively than repositories or web infrastructure can?