Evaluating Resilience Strategies Based on an Evolutionary Multi agent System Kazuhiro Minami, Tomoya Tanjo, and Hiroshi Maruyama Institute of Statistical.

Slides:



Advertisements
Similar presentations
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Advertisements

A Conceptual Framework for Economic Resiliency in the Context of Resistive Economics Reza Hosnavi Reza Hosnavi, Associate professor, Malek Ashtar University.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
THE MARKETING ENVIRONMENT
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Network Morphospace Andrea Avena-Koenigsberger, Joaquin Goni Ricard Sole, Olaf Sporns Tung Hoang Spring 2015.
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
Exact Computation of Coalescent Likelihood under the Infinite Sites Model Yufeng Wu University of Connecticut ISBRA
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Swami NatarajanJune 17, 2015 RIT Software Engineering Reliability Engineering.
SE 450 Software Processes & Product Metrics Reliability Engineering.
Rutgers PANIC Laboratory The State University of New Jersey Self-Managing Federated Services Francisco Matias Cuenca-Acuna and Thu D. Nguyen Department.
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
 Structured peer to peer overlay networks are resilient – but not secure.  Even a small fraction of malicious nodes may result in failure of correct.
Subgoal: conduct an in-depth study of critical representation, operator and other choices used for evolutionary program repair at the source code level.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
CHAPTER OVERVIEW SECTION 5.1 – MIS INFRASTRUCTURE
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Genetic Programming.
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
Genetic Algorithm.
CHAPTER FIVE INFRASTRUCTURES: SUSTAINABLE TECHNOLOGIES
Evolutionary Intelligence
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
` Research 2: Information Diversity through Information Flow Subgoal: Systematically and precisely measure program diversity by measuring the information.
Computer Science Open Research Questions Adversary models –Define/Formalize adversary models Need to incorporate characteristics of new technologies and.
70-294: MCSE Guide to Microsoft Windows Server 2003 Active Directory, Enhanced Chapter 4: Active Directory Architecture.
Genetic algorithms Prof Kang Li
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
An Analysis of Location-Hiding Using Overlay Networks Ju Wang and Andrew A. Chien Department of Computer Science and Engineering, University of California.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Emergent Robustness in Software Systems through Decentralized Adaptation: an Ecologically-Inspired ALife Approach Franck Fleurey, Benoit Baudry, Benoit.
Fuzzy Genetic Algorithm
Defining Vulnerability, resilience, risk Presentation outline Dr. Arjumand Nizami Photo: Intercooperation Pakistan by Tahir Saleem.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Artificial intelligence methods in the CO 2 permission market simulation Jarosław Stańczak *, Piotr Pałka **, Zbigniew Nahorski * * Systems Research Institute,
Formalizing the Resilience of Open Dynamic Systems Kazuhiro Minami (ISM), Tenda Okimoto (NII), Tomoya Tanjo (NII), Nicolas Schwind (NII), Hei Chan (NII),
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
EEL 5937 Managing mutability in agents EEL 5937 Multi Agent Systems Lecture 26, April 10, 2003 Lotzi Bölöni.
Bio-Networking: Biology Inspired Approach for Development of Adaptive Network Applications 21 May 2005Ognen Paunovski Bio-Networking: Biology Inspired.
Reactive Tabu Search Contents A brief review of search techniques
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Very Long-Term Planning: the Route to Sustainability Ken Cameron FCIP Sustainable Futures: a Boot Camp for Long-Range Planners.
Robot Intelligence Technology Lab. Evolutionary Robotics Chapter 3. How to Evolve Robots Chi-Ho Lee.
Lecturer: Eng. Mohamed Adam Isak PH.D Researcher in CS M.Sc. and B.Sc. of Information Technology Engineering, Lecturer in University of Somalia and Mogadishu.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Introduction to Genetic Algorithms
Evolutionary Algorithms Jim Whitehead
Particle Swarm Optimization (2)
MOBILE NETWORKS DISASTER RECOVERY USING SDN-NFV
School of Computer Science & Engineering
Local Search Algorithms
Evolutionary Algorithms
Basics of Genetic Algorithms (MidTerm – only in RED material)
Survivable Real-Time Network Services (G409/J175)
“Hard” Optimization Problems
An Original Model of Infrastructure System Resilience
Basics of Genetic Algorithms
SASS: Self-Adaptation using Stochastic Search
Local Search Algorithms
Beyond Classical Search
Alex Bolsoy, Jonathan Suggs, Casey Wenner
Presentation transcript:

Evaluating Resilience Strategies Based on an Evolutionary Multi agent System Kazuhiro Minami, Tomoya Tanjo, and Hiroshi Maruyama Institute of Statistical Mathematics, Japan December 4, 2013 CyberneticsCom 2013

We sometimes have an unexpected event 9.11 Lehman financial shock in earthquake and tunami 7/31/2012Kazuhiro Minami2 We cannot completely prevent such disasters Instead, we should aim to design a system that contains a damage and is readily recoverable to an acceptable level

Resilience: Definition “Capacity of a (social-ecological) system to absorb a spectrum of shocks or perturbations and to sustain and develop its fundamental function, structure, identity, and feedbacks as a result of recovery or reorganization in a new context.” -- by Buzz Holling (1973) 7/31/20123Kazuhiro Minami

Resilience = Resistance + Recovery Taoi-cho, Miyagi Pref Logstaff et al., “Building Resilient Communities,” Homeland Security Affairs, Vol VI, No.3, /31/2012Kazuhiro Minami4

Goal: How to make our systems more resilient against large unexpected events? 5 Financial Systems Civil Infrastructure Engineering Systems Society Organizations Natural Disasters Financial Crisis New Technologies Malicious Attackers

Biological science might be a major source of wisdom for resilience engineering 6 Redundancy Diversity Adaptability Multiple pathways for metabolism

Redundancy and diversity are heavily used techniques in Computer Science Maintain a backup system in a cloud service – Financial companies was able to continue their services after 9.11 event – Many web sites maintain multiple copies of the server Software diversity makes it difficult for hackers to compromise multiple servers of the same service – Change compiler options or use different algorithms Ethernet uses a randomization technique to avoid message collision 7

However, applying those techniques to real-world systems is NOT so trivial Cost for replication would be high in NON-ICT systems Replication sometimes decreases the quality of service – Inconsistency of data – Timely monitoring of a system is more difficult; thus need to sacrifice the adaptability of a system Toyota’s supply chain system put precedence on adaptability over redundancy 8

Multi-agent simulations based on a population genetics model Colony of n agents Each robot has ten binary features (e.g., 2-leg/4-leg, flying/non-flying, …) E.g., C: “fit” configurations Resource Resource Reserve R – Fit robots contribute to build up R – A robot consumes one unit for reconfiguring its one feature The colony is resilient if robots can survive a series of changing constraints C 1, C 2, …, C t, … Constraint C A Subset of 2 (set of all 1,024 configurations) A robot is fit if its configuration is in C 9

Represent a changing environment as a sequence of dynamic constraints 10 CtCt ` ` C t+1 Time tTime t+1 fit unfit

Need to pay a cost for adaptation 11 Resource Adaptation System bitstring Unfit fit Remove Add An adaptation in our model is much faster than that in biological systems Adaptation

A robot could produce a clone or die Make a clone – when the amount of the resource is doubled Die – when the resource is used up 12

Metrics of resilience in our model Redundancy – How much resource does a robot maintain? Diversity – Diversity index Adaptability – How many bits a robot can flip at a time? 13

Multi-agent Simulations Define initial parameters – Population size – Bit length of a robot – Size and type of constraints – Initial amount of each robot’s resource – Initial diversity index – Adaptation strategy Random or intelligent #flips at a time Run the system at 100 time steps Examine how a population size, the diversity index vary over time 14

Diversity at the beginning helps a population survive longer 15 ParameterValue Initial population size 100 Agent bit length 8 Constraint size26 Constraint transition continu ous Adaptation strategy random Adaptation speed 1 Time #Agents

Two adaptation Strategies 1. Random strategy (flip one bit randomly) 2. Intelligent strategy (flip one bit to be closer to the constraint) Constraint

If robots adapt intelligently, the population grows much faster 17 Time #Agents Time

If agents share the common resource, the sustainability of a system can be greatly improved 18 Shared resource Individual resources Sudden changes of the constraint Sudden changes of the constraint

Summary Explore design space parameterized by three resilience properties based on an evolutionary multi-agent system – Redundancy – Diversity – Adaptability Obtain quantitative initial results regarding design strategies for building resilient systems 19

Future work: Further possibilities for adaptation strategies Local vs Global – Local: Each robot makes its own decision independently from others – Global: There is a global coordination. Every robot must follow the order – Mixed Complete vs Incomplete knowledge on C – Complete knowledge: max 10 steps to become fit again – Incomplete knowledge: probabilistic (max 1023 steps if the landscape is stable) 20

21 Backup

We consider three types of constraints Disruptive changes: a new constraint C t is generated randomly at each time t 2. Small changes: a new constraint C t is generated from C t-1 by adding a neighbor configuration into C t-1 or removing a configuration in C t-1 T = tT = t-1T = t+1 T = tT = t-1T = t+1 3. Small changes with continuous topology: Same as case 2, but all configurations in C t are connected T = tT = t-1T = t+1

Measure diversity considers population abundance of each type 23 where N is the size of a population and p i is the size of an individual i Example 1: if N=5, Pr(`1101’) = 5, then D = 5 2 /5 2 = 1 Example 2: if N=5, size(`1101’) = 3, and size(`1111’) = 2, then D = 5 2 / = 25/13 = 1.92