Method for utilizing a generic algorithm to provide constraint-based routing of packets in a communication network
First Claim
1. A method for traffic engineering a packet network by assigning flows to working and protection paths within the packet network, each flow having a start point and an end point and comprising a finite number of packets, the method comprising the steps of:
- a). receiving input data for use in generating a genetic algorithm, b). generating candidate paths for each flow, c). generating a population of genotypes for each flow, d). evaluating the fitness of the genotypes, and e). evolving a new population of genotypes for each flow according to the fitness of existing genotypes, and f). repeating steps c)-e) until an acceptable genotype corresponding to assignment of at least one particular path for each flow is found, and g). reporting the flow assignments.
1 Assignment
0 Petitions
Accused Products
Abstract
A Path Generator connects to a communication network and uses genetic algorithms to assign flows to paths. Genotypes encode flow to path assignments for working and protection paths. Genotype fitness functions are computed as a weighted sum of constraint fitness functions. Each constraint fitness function evaluates the degrees to which the genotype is a satisfactory solution. The system can be used for network modeling. It can also receive requests for on-demand assignment of flows and on-demand rerouting of flows.
-
Citations
32 Claims
-
1. A method for traffic engineering a packet network by assigning flows to working and protection paths within the packet network, each flow having a start point and an end point and comprising a finite number of packets, the method comprising the steps of:
-
a). receiving input data for use in generating a genetic algorithm, b). generating candidate paths for each flow, c). generating a population of genotypes for each flow, d). evaluating the fitness of the genotypes, and e). evolving a new population of genotypes for each flow according to the fitness of existing genotypes, and f). repeating steps c)-e) until an acceptable genotype corresponding to assignment of at least one particular path for each flow is found, and g). reporting the flow assignments. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
Specification