An Improved Acquaintance Immunization Strategy for Complex Network.

Slides:

Advertisements

Similar presentations

Peer-to-Peer and Social Networks Power law graphs Small world graphs.

Advertisements

Topologies of Complex Networks Functions vs. Structures Lun Li Advisor: John C. Doyle Co-advisor: Steven H. Low Collaborators: David Alderson (NPS) Walter.

Complex Networks Advanced Computer Networks: Part1.

Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.

1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,

Power Laws By Cameron Megaw 3/11/2013. What is a Power Law?

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.

RESILIENCE NOTIONS FOR SCALE-FREE NETWORKS GUNES ERCAL JOHN MATTA 1.

School of Information University of Michigan Network resilience Lecture 20.

UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä

VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.

Daniel ben -AvrahamClarkson University Boston Universtiy Reuven Cohen Tomer Kalisky Alex Rozenfeld Bar-Ilan University Eugene Stanley Lidia Braunstein.

On Power-Law Relationships of the Internet Topology Michalis Faloutsos Petros Faloutsos Christos Faloutsos.

Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.

Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.

4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.

1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.

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.

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.

Evolvable by Design Panos Oikonomou James Franck Institute Institute of Biophysical Dynamics The University of Chicago Philippe Cluzel How topology affects.

Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.

Who Do You Know? A Simulation Study of Infectious Disease Control Through Contact Tracing Benjamin Armbruster and Margaret L. Brandeau Stanford University.

Agent-Organized Networks for Dynamic Team Formation Gaton, M.E. and desJardins, M., In Proceedings of AAMAS-2005, pp Seo, Young-Woo.

Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,

Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.

Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.

NETW 707 Modeling and Simulation Amr El Mougy Maggie Mashaly.

Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.

Prof. A. Taleb-Bendiab, Talk: SOAS’07, Contact: Date: 12/09/2015, Slide: 1 Software Engineering Concerns in Observing Autonomic.

Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.

Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU

E PIDEMIC SPREADING Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen 1.

Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.

Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.

Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,

Dynamics of Malicious Software in the Internet

Synchronization in complex network topologies

Efficient Content Sharing Taking Account of Updating Replicas in Hybrid Peer-to-Peer Networks Tatsuru Kato, Shinji Sugawara, Yutaka Ishibashi Nagoya Institute.

Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.

Online Social Networks and Media

Class 9: Barabasi-Albert Model-Part I

Percolation in self-similar networks PRL 106:048701, 2011

An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.

March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.

Mix networks with restricted routes PET 2003 Mix Networks with Restricted Routes George Danezis University of Cambridge Computer Laboratory Privacy Enhancing.

Models of Web-Like Graphs: Integrated Approach

Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/11/29 1 Research Direction Introduction.

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

Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.

Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.

Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.

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.

Epidemic Profiles and Defense of Scale-Free Networks L. Briesemeister, P. Lincoln, P. Porras Presented by Meltem Yıldırım CmpE

Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama

Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,

Marina Leri Institute of Applied Mathematical Research

Generative Model To Construct Blog and Post Networks In Blogosphere

Effective Social Network Quarantine with Minimal Isolation Costs

The likelihood of linking to a popular website is higher

Department of Computer Science University of York

CASE − Cognitive Agents for Social Environments

ModelNet: A Large-Scale Network Emulator for Wireless Networks Priya Mahadevan, Ken Yocum, and Amin Vahdat Duke University, Goal:

Peer-to-Peer and Social Networks

Introducing complex networks into quantum regime

Presentation transcript:

An Improved Acquaintance Immunization Strategy for Complex Network

Classic immunization strategies Random immunization strategy immunizes a node randomly High immunization threshold Target immunization strategy immunizes a node with most neighbor nodes Based on global information Acquaintance immunization strategy randomly chooses a node and randomly immunizes one of its neighbor nodes Blindness

Problem Existing improvements: a) existing improvements to acquaintance immunization(common neighbor, threaded-tree, double immunization) – static and whole scale b) determine local or time-varying importance ranking -- fail to deploy the benefits of acquaintance immunization strategy Need an improved strategy which is more adaptive to most network topology and achieve a better balance between cost and effectiveness.

Our method combining these two benefits acquaintance immunization (strong adaptability using little information) local and time-varying information (accuracy during immunization) Using NSI (Network structure index )

NSI Mark layer number Find value and connectivity Calculate NSI to reflect value of nodes e is the emphasis parameter, L is the possible damage through connections, T is layers

Simulation result The average number of 200 times simulations of infected node number during 100 immunization steps using In-depth Acquaintance Immunization strategy and Original one. protecting more nodes Rising slope decreased

More simulations GDTANG network with various connection possibilities Random graph with various scale Random graph with various wiring probabilities WS-Small World Model with various replacement probability Scale free model with various exponent of the degree distribution

Conclusion In GDTang and Scale-free network models, its performance is only second to target immunization In most random graph, it is even the best strategy In WS-Small World Model, it is not effective when network is highly regular in general, it has obvious advantage over the original acquaintance strategy (protects more nodes and control spread rate)