Analysis of Graphs for Digital Preservation Suitability

Computer Science – Digital Libraries

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Accepted for publication at HyperText 2010 ACM Conference on Hypertext and Hypermedia, 10 pages, 3 figures

Scientific paper

We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We attack the classic Erdos - Renyi random, Barab'asi and Albert power law, Watts - Strogatz small world and our Unsupervised Small-World (USW) graphs using different attacker strategies and report their respective robustness. Using different attacker profiles, we construct a game where the attacker is allowed to use a strategy of his choice to remove a percentage of each graph's elements. The graph is then allowed to repair some portion of its self. We report on the number of alternating attack and repair turns until either the graph is disconnected, or the game exceeds the number of permitted turns. Based on our analysis, an attack strategy that focuses on removing the vertices with the highest betweenness value is most advantageous to the attacker. Power law graphs can become disconnected with the removal of a single edge; random graphs with the removal of as few as 1% of their vertices, small-world graphs with the removal of 14% vertices, and USW with the removal of 17% vertices. Watts - Strogatz small-world graphs are more robust and resilient than random or power law graphs. USW graphs are more robust and resilient than small world graphs. A graph of USW connected web objects (WOs) filled with data could outlive the individuals and institutions that created the data in an environment where WOs are lost due to random failures or directed attacks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Analysis of Graphs for Digital Preservation Suitability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analysis of Graphs for Digital Preservation Suitability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Graphs for Digital Preservation Suitability will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-387349

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.