Path Computation Element (PCE) is a network entity that makes a calculation for the best routing path between a source node and a destination node in networks. It is a key technology to support virtualization of Software Defined Network (SDN) and Network Function Virtualization (NFV) for which packet processing power of virtual network nodes as well as bandwidth between them should be considered as a major parameter for the routing path calculation. However, current analytic algorithms including Dijkstra widely used can’t be applicable to some critical cases due to non-linear characteristic of parameters in which both link and performance costs are considered as parameters. This paper addresses that the current shortest path first algorithms are limited to a linear metric, and proposes a new Genetic Algorithm (GA) to support a non-linear metric for both link and performance costs.
Paper
Full text
Optimal Routing Path Calculation for SDN using Genetic Algorithm
Semantic Scholar · Computer Science · 2018
Abstract
Path Computation Element (PCE) is a network entity that makes a calculation for the best routing path between a source node and a destination node in networks. It is a key technology to support virtualization of Software Defined Network (SDN) and Network Function Virtualization (NFV) for which packet processing power of virtual network nodes as well as bandwidth between them should be considered as a major parameter for the routing path calculation. However, current analytic algorithms including Dijkstra widely used can’t be applicable to some critical cases due to non-linear characteristic of parameters in which both link and performance costs are considered as parameters. This paper addresses that the current shortest path first algorithms are limited to a linear metric, and proposes a new Genetic Algorithm (GA) to support a non-linear metric for both link and performance costs.