A routing computation method In IP networks

Existing routing methods are difficult to meet the requirements of real-time services. Generally, genetic routing algorithms may produce some paths of a network, but some of them really do not exist in the network. A routing computation method for IP networks based on genetic algorithm is proposed. It does not produce any path which does not exist actually in a network, so that it can shorten routing time. The simulation results show that the method can find the shortest path, and this indicates that the proposed method is feasible and effective.