Charles L. Cartledge Michael L. Nelson Old Dominion University Department of Computer Science Norfolk, VA 23529 USA.

Slides:



Advertisements
Similar presentations
Scale Free Networks.
Advertisements

Network Matrix and Graph. Network Size Network size – a number of actors (nodes) in a network, usually denoted as k or n Size is critical for the structure.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
School of Information University of Michigan Network resilience Lecture 20.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Unsupervised Creation of Small World Networks for the Preservation of Digital Objects Charles L. Cartledge Michael L. Nelson Old Dominion University Department.
Search in Power-Law Networks Presented by Hakim Weatherspoon CS294-4: Peer-to-Peer Systems Slides also borrowed from the following paper Path Finding Strategies.
The influence of search engines on preferential attachment Dan Li CS3150 Spring 2006.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
1 On Compressing Web Graphs Michael Mitzenmacher, Harvard Micah Adler, Univ. of Massachusetts.
Building Low-Diameter P2P Networks Eli Upfal Department of Computer Science Brown University Joint work with Gopal Pandurangan and Prabhakar Raghavan.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Advanced Topics in Data Mining Special focus: Social Networks.
Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
CS 206 Introduction to Computer Science II 03 / 30 / 2009 Instructor: Michael Eckmann.
The Shortest Path Problem
1 The Orphan Problem in ZigBee- based Wireless Sensor Networks IEEE Trans. on Mobile Computing (also in MSWiM 2007) Meng-Shiuan Pan and Yu-Chee Tseng Department.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Introduction to Graph Theory
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
Efficient Gathering of Correlated Data in Sensor Networks
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
Optimal serverless networks attacks, complexity and some approximate algorithms Carlos Aguirre Maeso Escuela Politécnica Superior Universidad Autónoma.
GRAPH THEORY.  A graph is a collection of vertices and edges.  An edge is a connection between two vertices (or nodes).  One can draw a graph by marking.
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
Science: Graph theory and networks Dr Andy Evans.
Lecture 5: Mathematics of Networks (Cont) CS 790g: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Mathematics of Networks (Cont)
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
- Anusha Uppaluri 1. Contents  Problem  Problems Importance  Research Methodology  Data Collection  Conclusion  References  Questions 2 2.
Decapitation of networks with and without weights and direction : The economics of iterated attack and defense Advisor : Professor Frank Y. S. Lin Presented.
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
Efficient Labeling Scheme for Scale-Free Networks The scheme in detailsPerformance of the scheme First we fix the number of hubs (to O(log(N))) and show.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Graphs. Introduction Graphs are a collection of vertices and edges Graphs are a collection of vertices and edges The solid circles are the vertices A,
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.
Informatics tools in network science
Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
Class 2: Graph Theory IST402.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
On the behaviour of an edge number in a power-law random graph near a critical points E. V. Feklistova, Yu.
1 Link Privacy in Social Networks Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar CIKM’08 Advisor: Dr. Koh, JiaLing Speaker: Li, HueiJyun Date: 2009/3/30.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Marina Leri Institute of Applied Mathematical Research
Network analysis.
Structural Properties of Networks: Introduction
Peer-to-Peer and Social Networks
Michael L. Nelson CS 495/595 Old Dominion University
Centralities (4) Ralucca Gera,
Department of Computer Science University of York
CASE − Cognitive Agents for Social Environments
Peer-to-Peer Information Systems Week 6: Performance
Switching Lemmas and Proof Complexity
Introduction to Digital Libraries Assignment #1
Presentation transcript:

Charles L. Cartledge Michael L. Nelson Old Dominion University Department of Computer Science Norfolk, VA USA

 Why the problem is of interest  Picking apart the title ◦ Preservation ◦ Graph ◦ Suitability  A game  Results  Conclusion 22

 In 2007, Bob received a photograph from an analog age  Bob wants to preserve the photograph into a digital age 33

 Scanned image of the photograph  Metadata ◦ Name ◦ Date ◦ Image type ◦ etc. 4 dc.name = “Josie McClure” dc.date = “28 Feb 1907” dc.type = “image/tiff” … Other data: TBD { Metadata Data {

5 + =

66 dc.name = “Josie McClure” dc.date = “28 Feb 1907” dc.type = “image/tiff” … Other data: TBD

77 Can web objects (WO) be constructed to act in an autonomous manner to create a network of WOs that live on the web architecture and can be expected to outlive the people and institutions that created them?

8

9  Repurpose one thing to do something else  To revisit how something works and utilize it in a new and novel way  “To bravely go where no one …” 9 Title: Analysis of Graphs for Digital Preservation Suitability

 Random – global construction  Power Law – global construction  Small World – global construction  Unsupervised Small World (USW) – local construction 10 Title: Analysis of Graphs for Digital Preservation Suitability “The number of systems of terminology presently used in graph theory is equal, to a close approximation, to the number of graph theorists.” Enumerative Combinatorics, 1986

 Robustness – a complex network is robust if it keeps is basic functionality even under failure of some of its components  Resilience – is how a network responds against repeated component failure 11 Brandes, “Network Analysis, Methodological Foundations”, 2005

 There are lots of ways to quantify the characteristics of a graph  This equation captures our intuition of damage to a graph based on its structure 12

 Centrality “denotes an order of importance on the vertices or edges of a graph by assigning real values to them.”  A centrality index “is only depending on the structure of the graph.” 13 Brandes, “Network Analysis, Methodological Foundations”, 2005

 The number of shortest paths between all nodes that go through an edge  Highest = 57 (more than one)  Lowest = 4 14

15  The number of shortest paths that go through a vertex  Highest = 69  Lowest = 0 (more than one)

16  The number of edges incident to a vertex  Highest = 4 (more than one)  Lowest = 1 (more than one)

Attack profile # of unique graphs Max. depth Min. depth Mean depth St. dev. Depth D-V-L428, D-V-H B-E-L B-E-H B-V-L53, B-V-H1222n/a 17  An attack profile uses a centrality measurement to decide which graph component to eliminate  Mallory will use an attack profile during the game

18  As the path length grows, graph knowledge grows from Local to Global

 Mallory’s goal - destroy the graph, or give up  Bob’s graph’s goal - survive  Rules of the game ◦ Alternating turns ◦ Mallory has to maintain the same attack profile through out ◦ Mallory has local knowledge only ◦ Mallory can only remove/destroy a maximum number of edges or vertices per turn ◦ Bob’s graph can only attempt to recreate a fixed percentage of the graph per turn 19

 Sample graph ◦ 20 vertices ◦ 24 edges ◦ Random degree distribution  Attack parameters ◦ Attack profile: B-V-H ◦ Malory has 2 shots per turn ◦ Path length: 2 edges 20

 Graph has 1,000 nodes  Attack parameters ◦ Attack profile: B-V-H ◦ Attacker has 100 shots per turn ◦ Path length: 10 edges  Resilience parameters ◦ Graph repair: 4% of nodes selected for potential reconstruction ◦ Same repair parameters as creation  Game ends at 10 turns or when the graph is disconnected 21  Results ◦ Power law graph – 1 vertex ◦ Random graph – 100 vertices ◦ Small world graph 140 vertices ◦ USW – 170 vertices

 WO contains digital data to be preserved  WO contains links to copies of itself and to other WOs  When WO is accessed, it checks the availability of its own copies and connections to “neighboring” WOs  If copies are lost, then initiate reconstruction processes 22 Self Others AccessedReconstruct Title: Analysis of Graphs for Digital Preservation Suitability

23  A USW graph is more robust than small-world, random or power law graphs  USW has shown to have better preservation potential than other tested graphs Charles L. Cartledge Michael L. Nelson Old Dominion University Department of Computer Science Norfolk, VA USA This work was funded in part by the National Science Foundation.