SELF-HEALING NETWORKS: REDUNDANCY AND STRUCTURE
|
|
- Amice Todd
- 5 years ago
- Views:
Transcription
1 SELF-HEALING NETWORKS: REDUNDANCY AND STRUCTURE Guido Caldarelli IMT, CNR-ISC and LIMS, London UK DTRA Grant HDTRA
2 INTRODUCTION The robustness and the shape Baran, P. On distributed Communications (1964) Using a mini-computer, Baran and his team developed simulation programs to test basic connectivity of an array of nodes with varying degrees of linking. That is, a network of n- ary degree of connectivity would have n links per node. The simulation randomly destroyed nodes and subsequently tested the percentage of nodes who remained connected. The result of the simulation revealed that networks where n>=3 had a significant increase in resilience against even as much as 50% node loss. Baran's conviction gained from the simulation was that redundancy was the key.
3 INTRODUCTION From Arpanet to Internet Baran, P. On distributed Communications (1964)
4 BASIC OF NETWORKS The difference between models 1 Degree frequency density P(k) = how many times you find a vertex whose degree is k P(k) P( k) e pn ( pn) k! k P ( k) k k 2 Degree Correlation Knn (k) = average degree of a neighbour of a vertex with degree k 3 Clustering Coefficient (k) = the average value of c for a vertex whose degree is k 4
5 Real world systems show a large number of interdependencies: physical interdependency; cyber interdependency; geographic interdependency; logical interdependency that need financial and political coordination. We need to move beyond topological characterization, and understand how to characterize, observe and control the dynamics of real networks. System A System B During the project Long term Paradigm shift Develop data driven models that go beyond the methodological and disciplinary boundaries of a specific approach. Theoretical, algorithmic, and computational framework that will enable us to evaluate the onset of tipping points, emergent phenomena, cooperative phenomena in multilevel networks. Use the tools of control theory to go beyond network characterization and understand the control of real networks. Breakthrough in the application of complex systems, algorithmic and network theory to the modeling and analysis of the integration of social interactions and technological and communication networks Learn to measure (observe), quantify, predict, and control complex systems.
6 INTRODUCTION TOPOLOGY AND ROBUSTNESS
7 INTRODUCTION TOPOLOGY AND ROBUSTNESS The idea is that as Baran noticed, SF is more fragile under attack (RED) But For failures SF is more robust (BLUE)
8 REDUNDANCY AND BIOLOGY SPECIES PREDATE WITH REDUNDANCY A spanning tree of a connected directed graph is any of its connected directed subtrees with the same number of vertices. In general, the same graph has more spanning trees with different topologies. Since the peculiarity of the system (FOOD WEBS),some are more sensible than the others.
9 REDUNDANCY AND BIOLOGY Trees key quantities Out-component size: 0,6 0,5 A X Y nn w X XY A Y 1 Out-component size distribution P(A) : 0,5 P(A) Sum of the sizes: C X A Y Y X Allometric relations: C C A C C A X X C(A) X 33 0,4 0,3 0,2 0,1 0 0,1 0,1 0,1 0,1 0, A A
10 REDUNDANCY AND BIOLOGY Topology to optimise flow on the tree
11 1 0 1 REDUNDANCY AND BIOLOGY Various Trees 0 C( A) A efficient P( A) stable A1 C( A) A 1 2 P( A) A 0 2 C( A) A inefficient P(A) cost unstable
12 REDUNDANCY AND OPTIMISATION COST OF FLOW A Capitalist solution, everyone connects, socially (total pipe length) costly Individually (#passages) rewarding B Socialist solution, strict rule to connect socially (total pipe length) rewarding Individually (#passages) costly C Fractal (natural) solution, socially (total pipe length) rewarding Individually (#passages) rewarding
13 SELF-HEALING DEFINITION Robustness vs Resilience Robustness is important But we want also to check Resilience (how you come back to business) The latter point has been considered less often
14 We describe as networks the pipelines of some service We model the networks with trees + redundant link We assume that the service follows some sort of Kirchoff s laws Service travels along the links On interruptions some nodes get isolated MODEL OF SELF HEALING SIMPLIFIED ASSUMPTIONS We have an interaction protocol only with the set of neighbouring nodes Unserved nodes try to reconnect to the active tree by waking up (activating) dormant backup links (assuming you can t repair the old)
15 MODEL OF SELF HEALING A Simple Example Self-healing capabilities are given by distributed communication protocols that exploit redundant links to recover the connectivity of the system
16 MODEL OF SELF HEALING How to measure success A natural metric to quantify the success of such a procedure is the fraction of served nodes (FoS). Which topology maximizes the FoS? We study the effects of varying the fraction of backup links (redundancy) according to different underlying connectivity patterns with respect to multiple random failures
17 MODEL OF SELF HEALING Topology used to study model properties
18 FRACTION OF SERVED NODES REGULAR GRID Regular grid The average fraction <FoS> of nodes that the self-healing protocol is able to restore decreases with the number of faults k with no relevant dependency on the redundancy; results are shown for a 104 nodes network.
19 FRACTION OF SERVED NODES BARABÁSI-ALBERT Barabási-Albert The average fraction <FoS> of nodes that the self-healing protocol is able to restore decreases with the number of faults k with no relevant dependency on the redundancy; results are shown for a 104 nodes network.
20 FRACTION OF SERVED NODES REGULAR GRID Small world The average fraction <FoS> of nodes that the self-healing protocol is able to restore decreases with the number of faults k with no relevant dependency on the redundancy; results are shown for a 104 nodes network.
21 FRACTION OF SERVED NODES COMPARISON OF TOPOLOGIES In fact, the most robust networks as expected are based on the SF topology; however, such a topology is unrealistic for technological networks. Our results on SW topologies hint that a very effective strategy to strengthen realistic networks is to add long range links.
22 MODEL OF SELF HEALING Algorithm We assume that nodes have only a local knowledge of the networks i.e., only about the state (active, dormant or failed) of their incoming links. To build the maximal connected tree, nodes communicate with their neighbors via a suitable distributed protocol allowing fault nodes to join the active network by activating dormant edges. In other words, nodes are endowed only with the minimal requirements of routing needed to reconstruct a spanning tree
23 REDUNDANCY HOLDS FOR OTHER NETWORKS AS WELL
24 Redundancy is key to assess resilience Natural environment already use We can possibly design systems to optimise resilience probability Not in all cases anyhow this is possible CONCLUSIONS Summary
25 FURTHER INFO Grants DTRA Grant HDTRA
26
Properties of Biological Networks
Properties of Biological Networks presented by: Ola Hamud June 12, 2013 Supervisor: Prof. Ron Pinter Based on: NETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION By Albert-László Barabási
More information(Social) Networks Analysis III. Prof. Dr. Daning Hu Department of Informatics University of Zurich
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Outline Network Topological Analysis Network Models Random Networks Small-World Networks Scale-Free Networks
More informationCascade Failures from Distributed Generation in Power Grids
Cascade Failures from Distributed Generation in Power Grids Antonio Scala CNR-ISC @ Univ. di Roma La Sapienza, IMT Alti Studi Lucca, LIMS London AIIC Italian Experts on Critical Infrastructures Sakshi
More informationThe Reliability, Efficiency and Treatment Quality of Centralized versus Decentralized Water Infrastructure 1
The Reliability, Efficiency and Treatment Quality of Centralized versus Decentralized Water Infrastructure 1 Dr Qilin Li, Associate Professor, Civil & Environmental Engineering, Rice University Dr. Leonardo
More informationExploiting the Scale-free Structure of the WWW
Exploiting the Scale-free Structure of the WWW Niina Päivinen Department of Computer Science, University of Kuopio P.O. Box 1627, FIN-70211 Kuopio, Finland email niina.paivinen@cs.uku.fi tel. +358-17-16
More informationPlan of the lecture I. INTRODUCTION II. DYNAMICAL PROCESSES. I. Networks: definitions, statistical characterization, examples II. Modeling frameworks
Plan of the lecture I. INTRODUCTION I. Networks: definitions, statistical characterization, examples II. Modeling frameworks II. DYNAMICAL PROCESSES I. Resilience, vulnerability II. Random walks III. Epidemic
More informationTopology Enhancement in Wireless Multihop Networks: A Top-down Approach
Topology Enhancement in Wireless Multihop Networks: A Top-down Approach Symeon Papavassiliou (joint work with Eleni Stai and Vasileios Karyotis) National Technical University of Athens (NTUA) School of
More informationApproaches for Quantifying
Approaches for Quantifying Multicast AW 2 15. 5. 2014 1 duction and Basics 2 3 4 Robustness with 5 duction Motivation High complexity leads to low predictability varies in different algorithms Long-Term
More informationNick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell
Nick Hamilton Institute for Molecular Bioscience Essential Graph Theory for Biologists Image: Matt Moores, The Visible Cell Outline Core definitions Which are the most important bits? What happens when
More informationExamples of Complex Networks
Examples of Complex Networks Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-
More informationWednesday, March 8, Complex Networks. Presenter: Jirakhom Ruttanavakul. CS 790R, University of Nevada, Reno
Wednesday, March 8, 2006 Complex Networks Presenter: Jirakhom Ruttanavakul CS 790R, University of Nevada, Reno Presented Papers Emergence of scaling in random networks, Barabási & Bonabeau (2003) Scale-free
More informationGraph Theory. Graph Theory. COURSE: Introduction to Biological Networks. Euler s Solution LECTURE 1: INTRODUCTION TO NETWORKS.
Graph Theory COURSE: Introduction to Biological Networks LECTURE 1: INTRODUCTION TO NETWORKS Arun Krishnan Koenigsberg, Russia Is it possible to walk with a route that crosses each bridge exactly once,
More informationSelf-Healing Networks: Redundancy and Structure
Walter Quattrociocchi 1,2,3, Guido Caldarelli 3,4,2, Antonio Scala 4,3,2 * 1 Laboratory for the modeling of biological and socio-technical systems, Northeastern University, Boston, Massachusetts, United
More informationConstructing a G(N, p) Network
Random Graph Theory Dr. Natarajan Meghanathan Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Introduction At first inspection, most
More informationBasics of Network Analysis
Basics of Network Analysis Hiroki Sayama sayama@binghamton.edu Graph = Network G(V, E): graph (network) V: vertices (nodes), E: edges (links) 1 Nodes = 1, 2, 3, 4, 5 2 3 Links = 12, 13, 15, 23,
More informationNDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016
NDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016 Caesar S. Benipayo, PhD Student Under advisement of Dr. Michael Grenn and Dr. Blake Roberts Department of Engineering
More informationNetwork Thinking. Complexity: A Guided Tour, Chapters 15-16
Network Thinking Complexity: A Guided Tour, Chapters 15-16 Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-pj45avc/
More informationFortum SGEM Program Presentation of ongoing research activities
Fortum SGEM Program Presentation of ongoing research activities MV and LV Network Automation Solutions in EU Benchmarking Research 1 Existing Distribution Grid Little change in the past few decades Mostly
More informationOn Pairwise Connectivity of Wireless Multihop Networks
On Pairwise Connectivity of Wireless Multihop Networks Fangting Sun and Mark Shayman Department of Electrical and Computer Engineering University of Maryland, College Park, MD 2742 {ftsun, shayman}@eng.umd.edu
More informationThe missing links in the BGP-based AS connectivity maps
The missing links in the BGP-based AS connectivity maps Zhou, S; Mondragon, RJ http://arxiv.org/abs/cs/0303028 For additional information about this publication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13070
More informationStructure of biological networks. Presentation by Atanas Kamburov
Structure of biological networks Presentation by Atanas Kamburov Seminar Gute Ideen in der theoretischen Biologie / Systembiologie 08.05.2007 Overview Motivation Definitions Large-scale properties of cellular
More informationOverlay (and P2P) Networks
Overlay (and P2P) Networks Part II Recap (Small World, Erdös Rényi model, Duncan Watts Model) Graph Properties Scale Free Networks Preferential Attachment Evolving Copying Navigation in Small World Samu
More informationDistributed Detection in Sensor Networks: Connectivity Graph and Small World Networks
Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks SaeedA.AldosariandJoséM.F.Moura Electrical and Computer Engineering Department Carnegie Mellon University 5000 Forbes
More informationMethods of Technical Risk Assessment in a Regional Context
Methods of Technical Risk Assessment in a Regional Context Wolfgang Kröger, Professor and Head of former Laboratory for Safety Analysis (www.lsa.ethz.ch) Founding Rector of International Risk Governance
More informationAn Evolving Network Model With Local-World Structure
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 47 423 An Evolving Network odel With
More informationSmart and Resilient Energy Systems: Metrics and Evaluation
Smart and Resilient Energy Systems: Metrics and Evaluation Igor Linkov and Matthew Bates Risk and Decision Sciences Team, US Army 6172339869 Igor.Linkov@usace.army.mil 1 Smart Resilient 2 Smart vs Resilient
More informationFault management. Acnowledgements
Fault management Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Computer Networks Design and Management - Acnowledgements Inspired by Davide
More informationA Generating Function Approach to Analyze Random Graphs
A Generating Function Approach to Analyze Random Graphs Presented by - Vilas Veeraraghavan Advisor - Dr. Steven Weber Department of Electrical and Computer Engineering Drexel University April 8, 2005 Presentation
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/4/2011 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu
More informationCSCI5070 Advanced Topics in Social Computing
CSCI5070 Advanced Topics in Social Computing Irwin King The Chinese University of Hong Kong king@cse.cuhk.edu.hk!! 2012 All Rights Reserved. Outline Scale-Free Networks Generation Properties Analysis Dynamic
More informationPhase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility
Phase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility Mayukh Nilay Khan May 13, 2010 Abstract Inspired by empirical studies researchers have tried to model various
More informationModels of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation Networked Life NETS 112 Fall 2017 Prof. Michael Kearns Roadmap Recently: typical large-scale social and other networks exhibit: giant component with small diameter sparsity
More informationUpgrading From a Successful Emergency Control System to a Complete WAMPAC System for Georgian State Energy System
Upgrading From a Successful Emergency Control System to a Complete WAMPAC System for Georgian State Energy System Dave Dolezilek International Technical Director Schweitzer Engineering Laboratories SEL
More informationSmallest small-world network
Smallest small-world network Takashi Nishikawa, 1, * Adilson E. Motter, 1, Ying-Cheng Lai, 1,2 and Frank C. Hoppensteadt 1,2 1 Department of Mathematics, Center for Systems Science and Engineering Research,
More information1 Homophily and assortative mixing
1 Homophily and assortative mixing Networks, and particularly social networks, often exhibit a property called homophily or assortative mixing, which simply means that the attributes of vertices correlate
More informationIntroduction to network metrics
Universitat Politècnica de Catalunya Version 0.5 Complex and Social Networks (2018-2019) Master in Innovation and Research in Informatics (MIRI) Instructors Argimiro Arratia, argimiro@cs.upc.edu, http://www.cs.upc.edu/~argimiro/
More informationOn Optimizing Command and Control Structures
On Optimizing Command and Control Structures 16th ICCRTS Gary F. Wheatley Best Paper Presentation Kevin Schultz, David Scheidt, {kevin.schultz, david.scheidt}@jhuapl.edu This work was funded in part by
More informationResponse Network Emerging from Simple Perturbation
Journal of the Korean Physical Society, Vol 44, No 3, March 2004, pp 628 632 Response Network Emerging from Simple Perturbation S-W Son, D-H Kim, Y-Y Ahn and H Jeong Department of Physics, Korea Advanced
More informationOn Complex Dynamical Networks. G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong
On Complex Dynamical Networks G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong 1 Complex Networks: Some Typical Examples 2 Complex Network Example: Internet (William
More informationConstructing a G(N, p) Network
Random Graph Theory Dr. Natarajan Meghanathan Associate Professor Department of Computer Science Jackson State University, Jackson, MS E-mail: natarajan.meghanathan@jsums.edu Introduction At first inspection,
More informationHow Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Roadmap Next several lectures: universal structural properties of networks Each large-scale network is unique microscopically,
More informationInformation Driven Healthcare:
Information Driven Healthcare: Machine Learning course Lecture: Feature selection I --- Concepts Centre for Doctoral Training in Healthcare Innovation Dr. Athanasios Tsanas ( Thanasis ), Wellcome Trust
More informationPreliminary results from an agent-based adaptation of friendship games
Preliminary results from an agent-based adaptation of friendship games David S. Dixon June 29, 2011 This paper presents agent-based model (ABM) equivalents of friendshipbased games and compares the results
More informationImportance of IP Alias Resolution in Sampling Internet Topologies
Importance of IP Alias Resolution in Sampling Internet Topologies Mehmet H. Gunes and Kamil Sarac Global Internet Symposium 007, Anchorage, AK Introduction: Internet Mapping Topology measurement studies
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationStatistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv: v1 [physics.soc-ph] 12 May 2008
Statistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv:0805.1712v1 [physics.soc-ph] 12 May 2008 Keumsook Lee a,b Woo-Sung Jung c Jong Soo Park d M. Y.
More informationTHE PRINCIPLE OF INDUCTION. MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin
THE PRINCIPLE OF INDUCTION MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin The Principle of Induction: Let a be an integer, and let P(n) be a statement
More informationSNA 8: network resilience. Lada Adamic
SNA 8: network resilience Lada Adamic Outline Node vs. edge percolation Resilience of randomly vs. preferentially grown networks Resilience in real-world networks network resilience Q: If a given fraction
More informationComplex Networks. Structure and Dynamics
Complex Networks Structure and Dynamics Ying-Cheng Lai Department of Mathematics and Statistics Department of Electrical Engineering Arizona State University Collaborators! Adilson E. Motter, now at Max-Planck
More informationFailure in Complex Social Networks
Journal of Mathematical Sociology, 33:64 68, 2009 Copyright # Taylor & Francis Group, LLC ISSN: 0022-250X print/1545-5874 online DOI: 10.1080/00222500802536988 Failure in Complex Social Networks Damon
More informationAutonomic Computing. Pablo Chacin
Autonomic Computing Pablo Chacin Acknowledgements Some Slides taken from Manish Parashar and Omer Rana presentations Agenda Fundamentals Definitions Objectives Alternative approaches Examples Research
More informationUniversal Properties of Mythological Networks Midterm report: Math 485
Universal Properties of Mythological Networks Midterm report: Math 485 Roopa Krishnaswamy, Jamie Fitzgerald, Manuel Villegas, Riqu Huang, and Riley Neal Department of Mathematics, University of Arizona,
More information6.207/14.15: Networks Lecture 5: Generalized Random Graphs and Small-World Model
6.207/14.15: Networks Lecture 5: Generalized Random Graphs and Small-World Model Daron Acemoglu and Asu Ozdaglar MIT September 23, 2009 1 Outline Generalized random graph models Graphs with prescribed
More informationExploring the Structure of Data at Scale. Rudy Agovic, PhD CEO & Chief Data Scientist at Reliancy January 16, 2019
Exploring the Structure of Data at Scale Rudy Agovic, PhD CEO & Chief Data Scientist at Reliancy January 16, 2019 Outline Why exploration of large datasets matters Challenges in working with large data
More informationAttack Vulnerability of Network with Duplication-Divergence Mechanism
Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 754 758 c International Academic Publishers Vol. 48, No. 4, October 5, 2007 Attack Vulnerability of Network with Duplication-Divergence Mechanism WANG
More informationBuilding the Multiplex: An Agent-Based Model of Formal and Informal Network Relations
Building the Multiplex: An Agent-Based Model of Formal and Informal Network Relations EURO 2016 POZNAN POLAND, 4 JULY 2016 Duncan A. Robertson and Leroy White Loughborough University, UK; Warwick Business
More informationPanel: Research on Complex Enterprise Systems of Systems. Complex Adaptive Systems Conference 14-NOV-2013
Panel: Research on Complex Enterprise Systems of Systems Complex Adaptive Systems Conference 14-NOV-2013 Dan DeLaurentis School of Aeronautics & Astronautics and Center for Integrated Systems in Aerospace
More informationM.E.J. Newman: Models of the Small World
A Review Adaptive Informatics Research Centre Helsinki University of Technology November 7, 2007 Vocabulary N number of nodes of the graph l average distance between nodes D diameter of the graph d is
More informationAlgorithms and Applications in Social Networks. 2017/2018, Semester B Slava Novgorodov
Algorithms and Applications in Social Networks 2017/2018, Semester B Slava Novgorodov 1 Lesson #1 Administrative questions Course overview Introduction to Social Networks Basic definitions Network properties
More informationA Statistical Method for Synthetic Power Grid Generation based on the U.S. Western Interconnection
A Statistical Method for Synthetic Power Grid Generation based on the U.S. Western Interconnection Saleh Soltan, Gil Zussman Columbia University New York, NY Failures in Power Grids One of the most essential
More informationAn Agent-Based Adaptation of Friendship Games: Observations on Network Topologies
An Agent-Based Adaptation of Friendship Games: Observations on Network Topologies David S. Dixon University of New Mexico, Albuquerque NM 87131, USA Abstract. A friendship game in game theory is a network
More informationCentralized versus distributed schedulers for multiple bag-of-task applications
Centralized versus distributed schedulers for multiple bag-of-task applications O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal and Y. Robert Laboratoire LaBRI, CNRS Bordeaux, France Dept.
More informationExercise set #2 (29 pts)
(29 pts) The deadline for handing in your solutions is Nov 16th 2015 07:00. Return your solutions (one.pdf le and one.zip le containing Python code) via e- mail to Becs-114.4150@aalto.fi. Additionally,
More informationElectricity Security Assessment Framework
Electricity Security Assessment Framework Extending the framework beyond borders Matthew Wittenstein ESAP Workshop VII April 28, 2016 Keeping the lights on while transforming the power system Electricity
More informationWhen Network Embedding meets Reinforcement Learning?
When Network Embedding meets Reinforcement Learning? ---Learning Combinatorial Optimization Problems over Graphs Changjun Fan 1 1. An Introduction to (Deep) Reinforcement Learning 2. How to combine NE
More informationAvailability Study of the Italian Electricity SCADA System in the Cloud
Availability Study of the Italian Electricity SCADA System in the Cloud Stefano Sebastio a, Antonio Scala b,a, and Gregorio D Agostino c,a a LIMS London Institute of Mathematical Sciences, London, UK b
More informationAnalytical reasoning task reveals limits of social learning in networks
Electronic Supplementary Material for: Analytical reasoning task reveals limits of social learning in networks Iyad Rahwan, Dmytro Krasnoshtan, Azim Shariff, Jean-François Bonnefon A Experimental Interface
More informationA New Parallel Algorithm for Connected Components in Dynamic Graphs. Robert McColl Oded Green David Bader
A New Parallel Algorithm for Connected Components in Dynamic Graphs Robert McColl Oded Green David Bader Overview The Problem Target Datasets Prior Work Parent-Neighbor Subgraph Results Conclusions Problem
More informationA Novel Technique for Finding Influential Nodes
A Novel Technique for Finding Influential Nodes Mini Singh Ahuja Department of Computer science, Guru Nanak Dev University, Regional Campus, Gurdaspur Abstract In complex networks there is a big issue
More informationExample for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows)
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows) Average clustering coefficient of a graph Overall measure
More informationEstablishing a Framework for Effective Testing and Validation of Critical Infrastructure Cyber-Security
Establishing a Framework for Effective Testing and Validation of Critical Infrastructure Cyber-Security Michael John SmartSec 2016, Amsterdam www.encs.eu European Network for Cyber Security The European
More informationGeneral Framework for Secure IoT Systems
General Framework for Secure IoT Systems National center of Incident readiness and Strategy for Cybersecurity (NISC) Government of Japan August 26, 2016 1. General Framework Objective Internet of Things
More informationThe Complex Network Phenomena. and Their Origin
The Complex Network Phenomena and Their Origin An Annotated Bibliography ESL 33C 003180159 Instructor: Gerriet Janssen Match 18, 2004 Introduction A coupled system can be described as a complex network,
More informationActive Clustering and Ranking
Active Clustering and Ranking Rob Nowak, University of Wisconsin-Madison IMA Workshop on "High-Dimensional Phenomena" (9/26-30, 2011) Gautam Dasarathy Brian Eriksson (Madison/Boston) Kevin Jamieson Aarti
More informationComplex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems
Complex networks Phys 682 / CIS 629: Computational Methods for Nonlinear Systems networks are everywhere (and always have been) - relationships (edges) among entities (nodes) explosion of interest in network
More informationGridEye FOR A SAFE, EFFICIENT AND CONTROLLED POWER GRID
FOR A SAFE, EFFICIENT AND CONTROLLED POWER GRID SMART GRID VISION To solve today s energy and pollution problems, DEPsys believes that the world should be powered entirely by renewable energy. By applying
More informationMinimal spanning tree networks in real and artificial financial markets
Minimal spanning tree networks in real and artificial markets Minimal spanning tree networks in real and artificial financial markets 05/09/03 Midterm Cosin Conference, Rome Minimal spanning tree networks
More informationHIGH LEVEL REQUIREMENTS OF FAST SIMULATION AND MODELLING SUITE OF TOOLS FOR FUTURE SELF-HEALING DISTRIBUTION POWER SYSTEM
HIGH LEVEL REQUIREMENTS OF FAST SIMULATION AND MODELLING SUITE OF TOOLS FOR FUTURE SELF-HEALING DISTRIBUTION POWER SYSTEM A. Valenti* I Bel ** S. Lee *EDF **EPRI E2I ConEdison France USA USA arnaud.valenti@edf.fr
More informationAn Introduction to Complex Systems Science
DEIS, Campus of Cesena Alma Mater Studiorum Università di Bologna andrea.roli@unibo.it Disclaimer The field of Complex systems science is wide and it involves numerous themes and disciplines. This talk
More informationLecture 7: Parallel Processing
Lecture 7: Parallel Processing Introduction and motivation Architecture classification Performance evaluation Interconnection network Zebo Peng, IDA, LiTH 1 Performance Improvement Reduction of instruction
More informationFast Topology Management in Large Overlay Networks
Topology as a key abstraction Fast Topology Management in Large Overlay Networks Ozalp Babaoglu Márk Jelasity Alberto Montresor Dipartimento di Scienze dell Informazione Università di Bologna! Topology
More information- relationships (edges) among entities (nodes) - technology: Internet, World Wide Web - biology: genomics, gene expression, proteinprotein
Complex networks Phys 7682: Computational Methods for Nonlinear Systems networks are everywhere (and always have been) - relationships (edges) among entities (nodes) explosion of interest in network structure,
More informationErdős-Rényi Model for network formation
Network Science: Erdős-Rényi Model for network formation Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Why model? Simpler representation
More informationWHY BUILDING SECURITY SYSTEMS NEED CONTINUOUS AVAILABILITY
WHY BUILDING SECURITY SYSTEMS NEED CONTINUOUS AVAILABILITY White Paper 2 Why Building Security Systems Need Continuous Availability Always On Is the Only Option. If All Systems Go Down, How Can You React
More informationCentralized versus distributed schedulers for multiple bag-of-task applications
Centralized versus distributed schedulers for multiple bag-of-task applications O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal and Y. Robert Laboratoire LaBRI, CNRS Bordeaux, France Dept.
More informationRandomized Rumor Spreading in Social Networks
Randomized Rumor Spreading in Social Networks Benjamin Doerr (MPI Informatics / Saarland U) Summary: We study how fast rumors spread in social networks. For the preferential attachment network model and
More informationSTRUCTURAL ANALYSIS OF ELECTRICAL NETWORKS
CRIS, Third International Conference on Critical Infrastructures, Alexandria, VA, September 2006 STRUCTURAL ANALYSIS OF ELECTRICAL NETWORKS Karla Atkins (*), Jiangzhuo Chen (*), V. S. Anil Kumar (*) and
More informationUsing network analysis to assess the centrality of second-tier banks in CHAPS
Using network analysis to assess the centrality of second-tier banks in CHAPS Ana Lasaosa CPSS workshop on payment system monitoring indicators 9 October 2012 Motivation Tiering in CHAPS creates risks:
More informationWhy the Threat of Downtime Should Be Keeping You Up at Night
Why the Threat of Downtime Should Be Keeping You Up at Night White Paper 2 Your Plan B Just Isn t Good Enough. Learn Why and What to Do About It. Server downtime is an issue that many organizations struggle
More informationFuture Grid Initiative Technology Challenges in Designing the Future Grid to Enable Sustainable Energy Systems
Future Grid Initiative Technology Challenges in Designing the Future Grid to Enable Sustainable Energy Systems Vijay Vittal Director, Power Systems Engineering Research Center Ira A. Fulton Chair Professor,
More informationThe Flooding Time Synchronization Protocol
The Flooding Time Synchronization Protocol Miklos Maroti, Branislav Kusy, Gyula Simon and Akos Ledeczi Vanderbilt University Contributions Better understanding of the uncertainties of radio message delivery
More informationγ : constant Goett 2 P(k) = k γ k : degree
Goett 1 Jeffrey Goett Final Research Paper, Fall 2003 Professor Madey 19 December 2003 Abstract: Recent observations by physicists have lead to new theories about the mechanisms controlling the growth
More informationThe Topology and Dynamics of Complex Man- Made Systems
The Topology and Dynamics of Complex Man- Made Systems Dan Braha New England Complex Institute Cambridge, MA, USA University of Massachusetts Dartmouth, MA, USA braha@necsi.edu http://necsi.edu/affiliates/braha/dan_braha-description.htm
More informationA Continuous 3-D Medial Shape Model with Branching
A Continuous 3-D Medial Shape Model with Branching Timothy B. Terriberry Guido Gerig Outline Introduction The Generic 3-D Medial Axis Review of Subdivision Surfaces Boundary Reconstruction Edge Curves
More informationUsing graph theoretic measures to predict the performance of associative memory models
Using graph theoretic measures to predict the performance of associative memory models Lee Calcraft, Rod Adams, Weiliang Chen and Neil Davey School of Computer Science, University of Hertfordshire College
More informationCybersecurity vs. Cyber Survivability: A Paradigm Shift
U.S. ARMY EVALUATION CENTER Cybersecurity vs. Cyber Survivability: A Paradigm Shift March 8, 2018 BLUF The T&E community should stop using the term cybersecurity when what we mean is cyber survivability
More informationHot Topics in IT Disaster Recovery
Risk Masters International LLC Hot Topics in IT Disaster Recovery Steven J. Ross Executive Principal A Presentation for the Middle Tennessee Chapter of ISACA The Popular View of IT Disaster Recovery Today
More informationComplex Networks: Ubiquity, Importance and Implications. Alessandro Vespignani
Contribution : 2005 NAE Frontiers of Engineering Complex Networks: Ubiquity, Importance and Implications Alessandro Vespignani School of Informatics and Department of Physics, Indiana University, USA 1
More informationNetwork Theory: Social, Mythological and Fictional Networks. Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao
Network Theory: Social, Mythological and Fictional Networks Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao Abstract: Comparative mythology is a largely qualitative and
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 3 Aug 2000
Error and attack tolerance of complex networks arxiv:cond-mat/0008064v1 [cond-mat.dis-nn] 3 Aug 2000 Réka Albert, Hawoong Jeong, Albert-László Barabási Department of Physics, University of Notre Dame,
More information