Enhancing Attack Robustness of Scale-free Networks by Camouflage

Slides:



Advertisements
Similar presentations
University of Nevada, Reno Router-level Internet Topology Mapping CS790 Presentation Modified from Dr. Gunes slides by Talha OZ.
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.
Performance analysis of LT codes with different degree distribution
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1.
The Impact of Imperfect Information on Network Attack Andrew Melchionna (University of Rochester) Jesús Caloca (Boise State University) Advisors: S. Squires,
Cascading failures in interdependent networks and financial systems -- Departmental Seminar Xuqing Huang Advisor: Prof. H. Eugene Stanley Collaborators:
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
University of Buffalo The State University of New York Spatiotemporal Data Mining on Networks Taehyong Kim Computer Science and Engineering State University.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
An Effective Placement of Detection Systems for Distributed Attack Detection in Large Scale Networks Telecommunication and Security LAB. Dept. of Industrial.
AITIA International Inc. and Lorand Eotvos University, Budapest ROBUST NETWORKS FROM LOCAL OPTIMIZATION A Bottom-Up Model to Generate Networks with Skewed.
Global topological properties of biological networks.
Transport Properties of Fractal and Non-Fractal Scale-Free Networks
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Attack-Resistant Networks Allen G. Taylor Communication networks have four primary objectives: Minimize.
Barcodes and ISBN numbers: which are better at detecting errors? Virtually all packaged products have a barcode on so that optical readers can recognise.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Robustness of complex networks English workshop on LEAP May 8, 2012 Kyushu Univ. Yuki YOSHIDA Dept. AEEA. Kyushu Univ.
Distributed Tracking Using Kalman Filtering Aaron Dyreson, Faculty Advisor: Ioannis Schizas, Ph.D. Department of Electrical Engineering, The University.
Complexity and Synchronization of the World trade Web Xiang Li, Yu Ying Jin, Guanrong Chen Fatih Er / System & Control.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Presentation: A measure of betweenness centrality based on random walks M.E.J. Newman ELSEVIER Social Networks November 2004 A measure of betweenness centrality.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Decapitation of networks with and without weights and direction : The economics of iterated attack and defense Advisor : Professor Frank Y. S. Lin Presented.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.
Gerhard Haßlinger Search Methods in Dynamic Wireless Networks  Challenges for search in wireless networks  Random walks and flooding for search with.
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.
An Improved Acquaintance Immunization Strategy for Complex Network.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Written By: Presented By: Swarup Acharya,Amr Elkhatib Phillip B. Gibbons, Viswanath Poosala, Sridhar Ramaswamy Join Synopses for Approximate Query Answering.
A Connectivity-Based Popularity Prediction Approach for Social Networks Huangmao Quan, Ana Milicic, Slobodan Vucetic, and Jie Wu Department of Computer.
Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
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.
The simultaneous evolution of author and paper networks
A traffic complexity approach through cluster analysis
Localization for Anisotropic Sensor Networks
Applications of graph theory in complex systems research
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
TITLE INTRODUCTION (CLICK TO EDIT) METHODS CONTINUED (CLICK TO EDIT)
K. Peters, L. Buzna, and D. Helbing, 2008
Self transforming to power law topology for overlay networks.
The Watts-Strogatz model
TITLE INTRODUCTION (CLICK TO EDIT) METHODS CONTINUED (CLICK TO EDIT)
S/W Maintenance Any work done to change the s/w after it is in operation is considered to be maintenance work. It is a broader activity which includes.
Peer-to-Peer and Social Networks Fall 2017
Robustness or Network Resilience
Department of Computer Science University of York
TITLE INTRODUCTION (CLICK TO EDIT) METHODS CONTINUED (CLICK TO EDIT)
Raymond Exclusive Algorithm
TITLE INTRODUCTION (CLICK TO EDIT) METHODS CONTINUED (CLICK TO EDIT)
Noémi Gaskó, Rodica Ioana Lung, Mihai Alexandru Suciu
Topology and Dynamics of Complex Networks
Peer-to-Peer and Social Networks
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Lecture 9: Network models CS 765: Complex Networks
Network Science: A Short Introduction i3 Workshop
TITLE INTRODUCTION (CLICK TO EDIT) METHODS CONTINUED (CLICK TO EDIT)
TITLE INTRODUCTION (CLICK TO EDIT) METHODS CONTINUED (CLICK TO EDIT)
Presentation transcript:

Enhancing Attack Robustness of Scale-free Networks by Camouflage 吴 俊 国防科大信息系统与管理学院管理系 wujunpla@hotmail.com

Contents Introduction Attack model with inaccurate information Enhancing attack robustness by camouflage Conclusions

Introduction The function and performance of complex networks rely on their robustness. Due to its broad applications, the attack robustness of complex networks has received growing attention.

Introduction The ultimate purpose of research on network robustness is to obtain a robust network. Many studies have been devoted to designing networks with optimal robustness 。 However, most real networks are the results of complex and extended processes; thus, designing new ones is almost impossible. Therefore, explore existing networks and improving their robustness by modifying the topology, e.g., adding, deleting, rewiring, or repairing edges, seem more feasible and effective.

Introduction Rather than modifying the network structure, an alternative approach is to change the information of the network structure.

Perfect Information

Incomplete Information

Inaccurate Information

Attack model with inaccurate information

Enhancing attack robustness by camouflage Camouflage range: Camouflage coefficient: Camouflage nodes in descending order of degree of nodes (‘rich strategy’) Random camouflage nodes (‘random strategy’) Camouflage nodes in ascending order of degree of nodes (‘poor strategy’)

Enhancing attack robustness by camouflage

Enhancing attack robustness by camouflage

Conclusions 假作真时真亦假; 无为有处有还无。 ——曹雪芹