Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Genetic Algorithms Vida Movahedi November Contents What are Genetic Algorithms? From Biology … Evolution … To Genetic Algorithms Demo.
Genetic Algorithms (Evolutionary Computing) Genetic Algorithms are used to try to “evolve” the solution to a problem Generate prototype solutions called.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Building Cloud-ready Video Transcoding System for Content Delivery Networks(CDNs) Zhenyun Zhuang and Chun Guo Speaker: 饒展榕.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
CSE 380 – Computer Game Programming Pathfinding AI
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Applying Genetic Algorithms to Decision Making in Autonomic Computing Systems Authors: Andres J. Ramirez, David B. Knoester, Betty H.C. Cheng, Philip K.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Evolutionary Computational Intelligence
Introduction to Genetic Algorithms Yonatan Shichel.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
A Hybrid Heuristic for the Traveling Salesman Problem R. Baraglia, J. I. Hildalgo, R. Perego CMPSC 580, Spring 2006.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Computer Science Genetic Algorithms10/13/10 1 An Investigation of Niching and Species Formation in Genetic Function Optimization Kalyanmoy Deb David E.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Attack-Resistant Networks Allen G. Taylor Communication networks have four primary objectives: Minimize.
The Shortest Path Problem
Khaled Rasheed Computer Science Dept. University of Georgia
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Multiple Sequence Alignment CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (Slides by J. Burg)
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
EVOLVING ANTS Enrique Areyan School of Informatics and Computing Indiana University January 24, 2012.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Genetic Algorithms Michael J. Watts
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Optimal resource assignment to maximize multistate network reliability for a computer network Yi-Kuei Lin, Cheng-Ta Yeh Advisor : Professor Frank Y. S.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem Sang-Moon Soak Speaker: 洪嘉涓、陳麗徽、李振宇、黃怡靜.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
1 Genetic Algorithms and Ant Colony Optimisation.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Optimizing Pheromone Modification for Dynamic Ant Algorithms Ryan Ward TJHSST Computer Systems Lab 2006/2007 Testing To test the relative effectiveness.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
Solving the Euclidean Non-Uniform Steiner Tree Problem Using a Genetic Algorithm Ian Frommer, Dept. of Mathematics, US Coast Guard Academy Bruce Golden,
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures Arthur Carvalho
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithms. Solution Search in Problem Space.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Genetic Algorithm(GA)
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Evolutionary Computation Evolving Neural Network Topologies.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Haploid-Diploid Evolutionary Algorithms
Optimization Of Robot Motion Planning Using Genetic Algorithm
Link-Level Internet Structures
Haploid-Diploid Evolutionary Algorithms
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Boltzmann Machine (BM) (§6.4)
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Beyond Classical Search
Presentation transcript:

Optimizing genetic algorithm strategies for evolving networks Matthew Berryman

Pleiotropy Single agent performing multiple tasks. Example 1: single protein such as p53 involved in several regulatory pathways. Example 2: single server performing multiple tasks such as , web server.

Redundancy Multiple agents performing same task. Example 1: some level of redundancy between bicoid and nanos/caudual in anterior-posterior axis formation in Drosophila. Example 2: load- sharing web servers.

Tradeoffs and combinations Redundancy: high robustness, high cost. Pleiotropy: low robustness, low cost. Combine both pleiotropy and redundancy to get an optimal combination of high redundancy and low cost.

Network parameters Set of clients, C, and set of servers, S. Positions of clients and servers set at random but with minimum spacing. Each client assigned a traffic value Each server has a fixed amount of traffic it can serve, T s. Utilization (ideally between 0.75 and 0.85)

Measuring redundancy and pleiotropy Each client i has out degree O i = number of links out of client Each server j has in degree I j = number of links into server Redundancy Pleiotropy

Fitness function F=R/P R = reliability, P = cost Minimize P, maximize R => maximize F

Origin of the species Mutations: –add links, remove links from set of edges, –add servers, remove servers from set S. Crossover (mating): –for two networks with sets of nodes (clients and servers), N a and N b, and edges, and form a new network Selection: only the fittest (5) reproduce. Population size is kept constant at 15 (rank selection)

Let’s watch some sex

Previous results - stuck in a rut

Results Link failure probability = 0.001%

Results Link failure probability = 10%

Results: convergence times Varying population size Varying link failure probability

Conclusions and future directions Crossover operator allows the GA to converge much faster than mutation alone. Cost function improved by using Dijsktra’s algorithm: optimizing towards minimum cost for a given reliability. More work needed to analyze the convergence time -- use a simple network with known results, get rid of link failures and server replacement. Multi-objective evolutionary algorithms (multiple fitness functions

Dijkstra’s algorithm Given an adjacency matrix, A, we compute the distance matrix D in (min,+) matrix multiplications.

Alternative approach Instead of clients, have a set of edge routers (eg DSL router for a business), connecting a set of data streams d i to a server.

Alternative approach: in pictures Instead of clients, have a set of edge routers (eg DSL router for a business), connecting a set of data streams d i to a server.

Alternative fitness function F=R/P R = reliability, P = cost Minimize P, maximize R => maximize F

Results: alternative cost function