Title: A Framework for Digital Object Self-Preservation
1Unsupervised Creation of Small World Networks for
the Preservation of Digital Objects
Charles L. Cartledge Michael L. Nelson Old
Dominion University Department of Computer
Science Norfolk, Virginia
2Order of Presentation
- Technology enablers
- Constraints
- Simple rules for Complex Behavior
- Simulation approach
- Simulation results
- Future work
3Motivation
4Technology Enablers
Cost data http//www.archivebuilders.com/whitepap
ers/22011p.pdf
5Constraints
6Reynoldss Rules for Flocking
- Collision Avoidance avoid collisions with nearby
flock mates - Velocity Matching attempt to match velocity with
nearby flock mates - Flock Centering attempt to stay close to nearby
flock mates
Images and rules http//www.red3d.com/cwr/boids/
Doctoral Consortium
6
7Types of Graphs
(Each graph has 20 vertices and 40 edges.)
8Desirable Graph Properties
9Unsupervised Small World Graph Creation
- 0.2 lt beta lt0.66
- gamma lt 0.6
CC is shown as dark lines L is shown as light
lines
10Phases/Activities
11Creation
Any DO
12Wandering
A
B
D
C
13Connecting
A
B
D
C
14Flocking
A
A
A
A
15Typical Simulation Parameters
- alpha 0.5
- beta 0.6
- gamma 0.1
- Number of DOs 1000
- Number of hosts 1000
- Min number desired replicas 3
- Max number desired replicas 10
- Max number of replicas per host 20
16Simulation Results and Analysis
17Future work
- Test the autonomous graphs for resilience to
error and attack - Test what happens when a graph becomes
disconnected - Test what happens when a disconnected graph
becomes re-connected
18Conclusions
- We have shown that Digital Objects can
autonomously create small world graphs based on
locally gleaned data - These graphs can be used for long term
preservation - We intend to study these graphs focusing on their
tolerance to isolated and widespread failures
19And that concludes my presentation.
20Backup Information
- Equations for Average Path Length and Clustering
Coefficients