Applying Genetic Algorithms to Decision Making in Autonomic Computing Systems Authors: Andres J. Ramirez, David B. Knoester, Betty H.C. Cheng, Philip K.

Slides:



Advertisements
Similar presentations
Annual International Conference On GIS, GPS AND Remote Sensing.
Advertisements

Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
ACAT05 May , 2005 DESY, Zeuthen, Germany Search for the Higgs boson at LHC by using Genetic Algorithms Mostafa MJAHED Ecole Royale de l’Air, Mathematics.
Tactical Event Resolution Using Software Agents, Crisp Rules, and a Genetic Algorithm John M. D. Hill, Michael S. Miller, John Yen, and Udo W. Pooch Department.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Genetic algorithms for neural networks An introduction.
Overview Distributed vs. decentralized Why distributed databases
Genetic Algorithm for Variable Selection
Genetic Algorithms Learning Machines for knowledge discovery.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Reliability-Redundancy Allocation for Multi-State Series-Parallel Systems Zhigang Tian, Ming J. Zuo, and Hongzhong Huang IEEE Transactions on Reliability,
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
CHAPTER 12 ADVANCED INTELLIGENT SYSTEMS © 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Genetic Algorithm.
Evolutionary Intelligence
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
Introduction to Genetic Algorithms and Evolutionary Computation
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Distributed Demand Scheduling Method to Reduce Energy Cost in Smart Grid Humanitarian Technology Conference (R10-HTC), 2013 IEEE Region 10 Akiyuki Imamura,
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Biologically-inspired ring design in Telecommunications Tony White
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
MAPLD 2005/254C. Papachristou 1 Reconfigurable and Evolvable Hardware Fabric Chris Papachristou, Frank Wolff Robert Ewing Electrical Engineering & Computer.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.
Multi-objective Topology Synthesis and FPGA Prototyping Framework of Application Specific Network-on-Chip m Akram Ben Ahmed Xinyu LI, Omar Hammami.
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Neural Networks And Its Applications By Dr. Surya Chitra.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Lecture 17: Dynamic Reconfiguration I November 10, 2004 ECE 697F Reconfigurable Computing Lecture 17 Dynamic Reconfiguration I Acknowledgement: Andre DeHon.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Research Direction Introduction Advisor: Frank, Yeong-Sung Lin Presented by Hui-Yu, Chung 2011/11/22.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Optimization Of Robot Motion Planning Using Genetic Algorithm
Evolving the goal priorities of autonomous agents
Data and Computer Communications
Packet Classification with Evolvable Hardware Hash Functions
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
EE368 Soft Computing Genetic Algorithms.
Boltzmann Machine (BM) (§6.4)
Self-Managed Systems: an Architectural Challenge
Presentation transcript:

Applying Genetic Algorithms to Decision Making in Autonomic Computing Systems Authors: Andres J. Ramirez, David B. Knoester, Betty H.C. Cheng, Philip K. McKinley Michigan State University Presented By: Shivashis Saha University of Nebraska-Lincoln

Outline Introduction Background – Remote Mirroring – Genetic Algorithm Proposed Approach – Plato Design – Fitness Function Case Study Conclusion 2

Introduction Autonomic Computing System – What is it? Self-configurable Anticipated execution vs Dynamic reconfiguration Three key components: 1.Monitoring 2.Decision making 3.Reconfiguration 3

Introduction Reconfiguration – Rule based decision making – Utility based decision making  Self adapt to scenarios considered at design time – Evolutionary computations  Limited to specific set of reconfiguration strategies 4

Contributions Plato – GA based decision making process Reconfiguration plans for changing requirements and environmental conditions  No need to plan in advance Dynamic reconfiguration of an overlay network Distributing data to a collection of remote data mirrors Design Objectives: 1.Minimize cost 2.Maximize data reliability 3.Maximize network performance 5

Remote Mirroring Copies of important data are stored at one or more secondary locations – Tradeoff between better performance with lower cost against greater potential for data loss Design choices – Type of links Throughput, latency, loss rate – Remote mirroring protocols Synchronous vs Asynchronous 6

Genetic Algorithm Chromosomes – 7

Genetic Algorithm Crossover – One-point vs Two-point 8

Genetic Algorithm Mutation 9

Genetic Algorithm Summarize the entire approach: 1.Generate initial population 2.Use crossover and mutation to generate new generation 3.Evaluate the offspring 4.Survival of the fittest 5.Go to step 2; Terminate when desired value achieved or the algorithm converged 10

Proposed Approach Input: A network of remote data mirrors Output: Construct an overlay network – Data can be distributed to all the nodes – Network must remain connected – Never exceed monetary budget – Minimize bandwidth for diffusing data 11

Plato Design Chromosome encodes a complete network – Link active or inactive Associated with seven propagation method There are 7 n(n-1)/2 *2 n(n-1)/2 possible link configurations 12

Fitness Function 13 Network’s fitness in terms of cost Network’s fitness in terms of performance Network’s fitness in terms of reliability

Fitness Function 14 Operational costs incurred by all active links Maximum amount of money allocated for the network

Fitness Function 15 Average latency over all active links Largest measured latency in the underlying network Total bandwidth in the overlay network Total effective bandwidth in the overlay network after data has been coalesced Limit on the best value achieved in terms of bandwidth reduction

Fitness Function 16 Number of active links used Maximum number of possible links Total amount of data that could be lost as a result of the propagation method Amount of data that could be lost by selecting the propagation method with the largest time window for write coalescing

Fitness Function Each link stores the values such as throughput, latency, loss rate, etc Rescale coefficients when requirements change – The change of coefficients are mentioned in response to high-level monitoring events – Do not explicitly specify the reconfiguration plan 17

Case Study 18

Case Study 19 GA converges

Case Study 20 1.Maximum fitness around 88, not 100! 2.Activate all 300 links for maximum reliability 3.Synchronous propagation is dominant

Case Study 21 1.Network has 32 links, majority use asynchronous propagation 2.Overall, provides a combination of performance and reliability while keeping the cost low

Case Study 22

Case Study 23 At first more fit network has fewest active links. But, at the end 8 additional links were added.

Case Study 24

Case Study 25

Case Study 26 Link failure

Case Study 27 Link failure Minimize cost Improved robustness

Case Study 28 Data loss: measured on a log scale; byproduct of the propagation methods Link failure

Conclusion Plato integrates GA into decision making process of adaptive and autonomic systems – Supports dynamic reconfiguration – Does not explicitly encode prescriptive reconfiguration strategies to address scenarios which may arise in future – It uses user defined fitness to evolve reconfiguration plans in response to environmental changes 29

Thanks! 30