Analysis of graphs for digital preservation suitability

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 r...

• Type: Conference
• Year: 2010
• Where: HT
• Authors: Charles L. Cartledge, Michael L. Nelson
• Keywords: HT 2010, Internet Technology, Power Law Graphs, Small World, Small-world Graphs