Automating a Solution for Optimum PTP Deployment

Similar documents
Evolutionary robotics Jørgen Nordmoen

A Review on Genetic Algorithm and Its Applications

The Application of Multi-Level Genetic Algorithms in Assembly Planning

Local Search: Hill Climbing. When A* doesn t work AIMA 4.1. Review: Hill climbing on a surface of states. Review: Local search and optimization

Shuffled Complex Evolution

Creating a Dominion AI Using Genetic Algorithms

A general quadratic programming method for the optimisation of genetic contributions using interior point algorithm. R Pong-Wong & JA Woolliams

Exercise 4 Exploring Population Change without Selection

CHAPTER 3 HARMONIC ELIMINATION SOLUTION USING GENETIC ALGORITHM

CPS331 Lecture: Genetic Algorithms last revised October 28, 2016

Evolutions of communication

Evolution of Sensor Suites for Complex Environments

EVOLUTIONARY ALGORITHMS IN DESIGN

Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters

THE EFFECT OF CHANGE IN EVOLUTION PARAMETERS ON EVOLUTIONARY ROBOTS

Automated Software Engineering Writing Code to Help You Write Code. Gregory Gay CSCE Computing in the Modern World October 27, 2015

An Optimized Performance Amplifier

Differential Evolution and Genetic Algorithm Based MPPT Controller for Photovoltaic System

Computational Intelligence Optimization

2. Simulated Based Evolutionary Heuristic Methodology

Cooperative Behavior Acquisition in A Multiple Mobile Robot Environment by Co-evolution

Creating a Poker Playing Program Using Evolutionary Computation

Research Projects BSc 2013

Localized Distributed Sensor Deployment via Coevolutionary Computation

Optimum contribution selection conserves genetic diversity better than random selection in small populations with overlapping generations

NAVIGATION OF MOBILE ROBOT USING THE PSO PARTICLE SWARM OPTIMIZATION

CONTROLLER DESIGN BASED ON CARTESIAN GENETIC PROGRAMMING IN MATLAB

AIS and Swarm Intelligence : Immune-inspired Swarm Robotics

Collaborative transmission in wireless sensor networks

BIOLOGY 1101 LAB 6: MICROEVOLUTION (NATURAL SELECTION AND GENETIC DRIFT)

A Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem

EvoCAD: Evolution-Assisted Design

Beneficial Role of Humans and AI in a Machine Age of the Telco EcoSystem

Implicit Fitness Functions for Evolving a Drawing Robot

Global Asynchronous Distributed Interactive Genetic Algorithm

The Genetic Algorithm

Evolutionary Programming Optimization Technique for Solving Reactive Power Planning in Power System

Real-time Grid Computing : Monte-Carlo Methods in Parallel Tree Searching

Smart Grid Reconfiguration Using Genetic Algorithm and NSGA-II

Evolving Adaptive Play for the Game of Spoof. Mark Wittkamp

Meta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization

CHAPTER 5 PERFORMANCE EVALUATION OF SYMMETRIC H- BRIDGE MLI FED THREE PHASE INDUCTION MOTOR

NUMERICAL SIMULATION OF SELF-STRUCTURING ANTENNAS BASED ON A GENETIC ALGORITHM OPTIMIZATION SCHEME

Adaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm

Algorithms for Genetics: Basics of Wright Fisher Model and Coalescent Theory

THE DRIVING FORCE BEHIND THE FOURTH INDUSTRIAL REVOLUTION

Biologically Inspired Embodied Evolution of Survival

Multi-objective Optimization Inspired by Nature

Evolutionary Computation and Machine Intelligence

Chapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM

Genetic Programming of Autonomous Agents. Senior Project Proposal. Scott O'Dell. Advisors: Dr. Joel Schipper and Dr. Arnold Patton

GENETIC PROGRAMMING. In artificial intelligence, genetic programming (GP) is an evolutionary algorithmbased

GA Optimization for RFID Broadband Antenna Applications. Stefanie Alki Delichatsios MAS.862 May 22, 2006

A Genetic Algorithm for Solving Beehive Hidato Puzzles

PID Controller Tuning using Soft Computing Methodologies for Industrial Process- A Comparative Approach

Combining structural performance and designer preferences in evolutionary design space exploration

CS 441/541 Artificial Intelligence Fall, Homework 6: Genetic Algorithms. Due Monday Nov. 24.

Improving Evolutionary Algorithm Performance on Maximizing Functional Test Coverage of ASICs Using Adaptation of the Fitness Criteria

TJHSST Senior Research Project Evolving Motor Techniques for Artificial Life

Submitted November 19, 1989 to 2nd Conference Economics and Artificial Intelligence, July 2-6, 1990, Paris

Multiple-constraint Genetic Algorithm in Housing Design

PROGRAMMING BASICS DAVID SIMON

Evolutionary Robotics. IAR Lecture 13 Barbara Webb

Digital Filter Design Using Multiple Pareto Fronts

Implementation of FPGA based Decision Making Engine and Genetic Algorithm (GA) for Control of Wireless Parameters

Retaining Learned Behavior During Real-Time Neuroevolution

SECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM

CSC 396 : Introduction to Artificial Intelligence

Total Harmonic Distortion Minimization of Multilevel Converters Using Genetic Algorithms

Balanced Map Generation using Genetic Algorithms in the Siphon Board-game

ODMA Opportunity Driven Multiple Access

Stock Price Prediction Using Multilayer Perceptron Neural Network by Monitoring Frog Leaping Algorithm

SEPTEMBER, 2018 PREDICTIVE MAINTENANCE SOLUTIONS

Genetic Algorithms with Heuristic Knight s Tour Problem

LANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS

Economic optimisation of an ore processing plant with a constrained multi-objective evolutionary algorithm

Sensitivity Analysis of Drivers in the Emergence of Altruism in Multi-Agent Societies

A Numerical Approach to Understanding Oscillator Neural Networks

A Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems

FOUR TOTAL TRANSFER CAPABILITY. 4.1 Total transfer capability CHAPTER

Networked and Distributed Control Systems Lecture 1. Tamas Keviczky and Nathan van de Wouw

UNIVERSITY of PENNSYLVANIA CIS 391/521: Fundamentals of AI Midterm 1, Spring 2010

Applying Mechanism of Crowd in Evolutionary MAS for Multiobjective Optimisation

Improving AI for simulated cars using Neuroevolution

Evolutionary Electronics

Hardware Evolution. What is Hardware Evolution? Where is Hardware Evolution? 4C57/GI06 Evolutionary Systems. Tim Gordon

A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms

TELLING STORIES OF VALUE WITH IOT DATA

The future of work. Artificial Intelligence series

IAC-16-D1.2.1 (34366) Automated Design of CubeSats and Small Spacecrafts

Introduction to Computer Science - PLTW #9340

Review of Soft Computing Techniques used in Robotics Application

Available online at ScienceDirect. Procedia Computer Science 24 (2013 )

Developing Frogger Player Intelligence Using NEAT and a Score Driven Fitness Function

Genetic Algorithms in MATLAB A Selection of Classic Repeated Games from Chicken to the Battle of the Sexes

RISTO MIIKKULAINEN, SENTIENT ( SATIENT/) APRIL 3, :23 PM

RESERVOIR CHARACTERIZATION

ESSENTIAL ELEMENT, LINKAGE LEVELS, AND MINI-MAP SCIENCE: HIGH SCHOOL BIOLOGY SCI.EE.HS-LS1-1

arxiv: v1 [q-bio.pe] 4 Mar 2013

Self-Organising, Open and Cooperative P2P Societies From Tags to Networks

Transcription:

Automating a Solution for Optimum PTP Deployment ITSF 2015 David O Connor

Bridge Worx in Sync Sync Architect V4: Sync planning & diagnostic tool. Evaluates physical layer synchronisation distribution by behaviour simulation. (2000). Sync Architect V5: Sync planning & diagnostic tool. Evaluates physical layer and PTP synchronisation distribution by behaviour simulation. (2016). Sync Architect V6: Sync planning, diagnostic and management platform. Predicts optimum resource deployment. Monitors actual synchronisation behaviour against ideal simulated behaviour. (2017).

The Optimisation Elephant It s a question we constantly get asked by Architect users, Can you provide a button that just plans it for you? It s the elephant in our room. We would like to be able to say, yes. Network optimisation (because that s really what planning is) is extremely complex. Is it based on, if then else algorithms? We don t think so. I would like to share with you some research and development we are currently working on

PTP Resource Optimisation We are developing a generic network optimisation engine, its first target application is the optimisation of Precision Time Protocol resource deployment: What s the minimum resources I need to hit my quality target? Where should I deploy these resources? How should I route PTP streams? How can I efficiently implement protection and load sharing? Oh and don t forget I ve got some existing constraints so how can I minimise change?

An Evolutionary Approach Our research is currently based on the concept of Evolutionary Algorithms (EAs). EAs are a subset of evolutionary computation within the wider field of artificial intelligence. They are roughly based upon the basic mechanisms of biological evolution: reproduction, mutation and selection. Candidate solutions are individuals within a population. Each are evaluated for their suitability (fitness) and are selected in pairs, based on their fitness, to play the role of parents to two new offspring solutions based upon their parent s genes. A touch of random mutation is thrown in to spice things up. The process is repeated through many generations of the population until an ideal solution emerges.

How do they Work? A simplistic example: suggest the most attractive face?..

When do we Stop Hunting? If we observe the fitness of the best solution per generation (population) The fitness plateaus, suggesting the algorithm can not find a better solution.

Premature Convergence Imagine we have a two dimensional problem and we map the entire solution space True Solution Premature Convergences The algorithm is compelled to follow the surface to a maxima but the true solution can only be found if the algorithm can break out of a false maxima Increase mutation The true solution

Real World Applications Evolutionary Algorithms perform well maximising solutions to all types of problems because they are not prescriptive they meekly follow fitness for purpose. They are widely used in; engineering design, art, biology, economics, marketing, genetics, operations research, robotics, social sciences, physics, politics and chemistry. They tend to be applied to well constrained problems because they don t scale well to large issues, fitness can be difficult to quantify, and as we have seen, stop criteria is a problem. and now PTP deployment

Challenge 1 How to build a solution genome based on network resources and topology? Most EA solutions are based upon simple string or tree representations of solution operators. Ours must be far more complex we thought, but it didn t turn out that bad... Central single network object model as context reference. Our simulation models are ideally suited (given a little pruning). Solutions are just differential models based on the central object model.

Challenge 2 How can we determine degrees of fitness for a solution with enough resolution to drive the reproductive process? Fitness can not yield a simple, yes/no result if it is to efficiently drive the reproductive process. Our network behaviour simulations are ideal measures of fitness providing both blatant and subtle indicators of solution suitability. They allow us to provide a feature almost unique in the field of EAs: the user can simply modify the fitness evaluation by electing network behavioural properties without having to modify the simulation itself.

Challenge 3 How do we optimise the processing power required? Our experience of network simulation has taught us that simulation as an evaluation technique is not cheap in terms of processing power. Even an evaluation time of just 10 seconds could represent a convergence time of 18 days! There are many techniques we use to minimise convergence time: Parallel processing of solution fitness ideally every individual simultaneously. Incest Prevention: Not allowing identical individuals to be selected for reproduction. Elitism: Automatically promoting the best individuals to the next generation without reproduction or mutation. Steered Mutation: Not allowing invalid mutations. Exaggerated Mutation: Increasing the extent of mutation as individuals converge on a fitness maxima.

Challenge 4 How do we identify the stop criteria? The bugbear of all EAs. With an increase in solution complexity comes another possibility, just good enough solutions. We are using the simulation based evaluation to drive to solutions where some subtleties become irrelevant and once a solution achieves a just good enough criteria the search can stop.

How is it Going? Our primary application of this engine, Sync Architect V6 is currently in development and is scheduled for release in late 2017. Our network models and behaviour simulations have lent themselves well to the EA Engine. We are currently working distributing solution evaluation in the Cloud. Our ultimate goal is to build a generic network optimisation engine designed to allow all manner of optimisations to be performed by deploying behavioural simulations But we need your help

Our Greenhouse The Bridge Worx Greenhouse is a collaborative online forum where we invite you to take an active role in our development projects. www.bridgeworx.co.uk david.oconnor@bridgeworx.co.uk

Thank you