Then we describe a genetic algorithm based on the Candidate-Route Library to solve it.

Using this method proposed here, both executing and candidate paths are generated for the application,the expectation path within candidate paths is found,and then the assumed fault is located by comparing the executing path with the candidate path.

The original LDM algorithm tries to find a set of candidate paths and selects a path with the highest probability from the candidate path set to assign a flow.

Using this method proposed here, we generate both executing and candidate paths for the application, finding the expectation path within candidate paths, and then to locate the assumed fault by comparing the executing path with the candidate path.

Multi-constrained QoS routing selection based on niche immune algorithm

Though considering about dynamic routing selection and proportional fair scheduling jointly,the network can get the multi-user diversity gain and routing selection gain.

A QoS-based routing algorithm;

Improved quantum genetic algorithm for routing problem;

Realization and simulation of heuristic algorithm in QoS routing;

Optimizations of route selection and capacity and flow assignments in computer networks;

Study on optimizations for route selection and capacity and flow assignment in networks based on improved particle swarm optimization algorithm;

Mobile ip Route Selection Based on Hybrid Genetic Algorithm;