1 / 20

Unsupervised Creation of Small World Networks for the Preservation of Digital Objects

This paper discusses the creation of small world networks by digital objects autonomously, for long-term preservation. The simulation results and future work are also presented.

rbond
Download Presentation

Unsupervised Creation of Small World Networks for the Preservation of Digital Objects

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Unsupervised 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

  2. Order of Presentation • Technology enablers • Constraints • Simple rules for Complex Behavior • Simulation approach • Simulation results • Future work JCDL Short Paper Presentation

  3. 1907 2007 2107 Time Motivation JCDL Short Paper Presentation

  4. Technology Enablers Cost data: http://www.archivebuilders.com/whitepapers/22011p.pdf JCDL Short Paper Presentation

  5. “ … Tomorrow we could see the National Library of Medicine abolished by Congress, Elsevier dismantled by a corporate raider, the Royal Society declared bankrupt, or the University of Michigan Press destroyed by a meteor. All are highly unlikely, but over a long period of time unlikely events will happen. …” (emphasis CLC) W. Y. Arms, “Preservation of Scientific Serials: Three Current Examples,” Journal of Electronic Publishing, Dec., 1999 Constraints 75 12 – 101 yrs 80 Expectancy data: http://www.cdc.gov/nchs/data/nvsr/nvsr57/nvsr57_14.pdf Those that die, do so in avg. 23 yrs. 5 – 60 yrs http://www.lbl.gov/Science-Articles/Archive/ssc-and-future.html http://www.dod.mil/brac/ http://www.hq.nasa.gov/office/pao/97budget/zbr.txt Picture: Patricia W. and J Douglas Perry Library, Old Dominion University http://www2.westminster-mo.edu/wc_users/homepages/staff/brownr/ClosedCollegeIndex.htm JCDL Short Paper Presentation

  6. Reynolds’s Rules for Flocking • My interpretation • Namespace collision avoidance • Following others to available storage locations • 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 • Deleting copies of one’s self to provide room for late arrivers Images and rules: http://www.red3d.com/cwr/boids/ JCDL Short Paper Presentation Doctoral Consortium 6

  7. Small World Shorter Still high Types of Graphs (Each graph has 20 vertices and 40 edges.) JCDL Short Paper Presentation

  8. Desirable Graph Properties JCDL Short Paper Presentation

  9. Unsupervised Small World Graph Creation • gamma = 0.0 • alpha = 0.99 • gamma = 0.7 • alpha = 0.99 • 0.2 <= beta <=0.66 • gamma < 0.6 CC is shown as dark lines L is shown as light lines JCDL Short Paper Presentation

  10. Creation (Human or archivist activities) Wandering (Autonomous activities) Connecting (Autonomous activities) Flocking (Autonomous activities) Phases/Activities JCDL Short Paper Presentation

  11. Creation Any DO JCDL Short Paper Presentation

  12. Wandering A B Who are you connected to? Who are you connected to? Who are you connected to? Who are you connected to? Connected to: B Connected to: A Connected to: <Nil> Connected to: A Who are you connected to? Who are you connected to? Connected to: A Connected to: B, C D C JCDL Short Paper Presentation

  13. Connecting A B Connection NOT established Possible connection Connection established Possible connection D C JCDL Short Paper Presentation

  14. Flocking A B C’ D’ A’ A’’ D C D’’ A’’ A’ C’’ JCDL Short Paper Presentation

  15. Typical 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 JCDL Short Paper Presentation

  16. Simulation Results and Analysis JCDL Short Paper Presentation

  17. Future 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 JCDL Short Paper Presentation

  18. Conclusions • 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 JCDL Short Paper Presentation

  19. And that concludes my presentation. JCDL Short Paper Presentation

  20. Backup Information • Equations for Average Path Length and Clustering Coefficients JCDL Short Paper Presentation

More Related