Network Routing with the Use of Evolutionary Methods
Masaharu Munetomo · 2018
This chapter introduces status of researches in applications of evolutionary methods to network routing algorithms. Network routing algorithms determine routes from source node to destination for communication. A simple genetic algorithms consists of three genetic operators: crossover, mutation, and selection applied repeatedly to a population of strings in order to find optimal or near optimal solutions. The order-based genetic algorithm is based on a permutation representation of strings, each of which represents the order of call request assignment. In a packet-switching network which transmits data with communication packets, a routing algorithm determines where to forward packets to deliver them to their destination nodes. The Genetic-Based Routing algorithm is an adaptive routing algorithm in the Internet that employs a genetic algorithm with path genetic operators. A fitness value of a route is calculated from communication latency along it. The algorithms presented tried to manage their routing decisions by introducing learning procedures based on evolutionary technique.