| CPC H04L 45/22 (2013.01) [H04L 45/128 (2013.01); H04L 45/14 (2013.01); H04L 45/28 (2013.01)] | 8 Claims |
|
1. A computer implemented method of determining non-intersecting primary routes and secondary routes between a source node and a destination node in a communications network represented by a graph data structure of a plurality of nodes and a plurality of edges, each of the plurality of edges having associated a weight corresponding to a resource involved in traversing the respective edge, the computer implemented method comprising:
defining a population set of primary routes based on at least one initial primary route between the source node and the destination node and at least one additional primary route defined based on a mutation of the at least one initial primary route, wherein the at least one initial primary route is determined by a greedy route-finding algorithm, and wherein each primary route in the population set of primary routes identifies a secondary route based on the greedy route-finding algorithm applied to a graph excluding edges in the respective primary route, such that the population set of primary routes and the identified secondary routes are non-intersecting routes, each comprising at least one edge of the plurality of edges, through the graph data structure;
applying a genetic algorithm to the population set of primary routes to iteratively select and crossover one or more pairs of the primary routes in the population set of primary routes, the genetic algorithm being applied until a stopping condition is reached, wherein at least a subset of the selected one or more pairs of the primary routes are mutated in the population set of primary routes; and
selecting, from the population set of primary routes, a primary route and a corresponding secondary route of the identified secondary routes that together have a lowest aggregate weight of edges.
|