An Efficient Algorithm for Multiple Shortest Path under Delay and Cost Constraints

In integrated network,a crucial aspect of Quality of Service(QoS)is to find multiple shortest feasible paths that meet end to end delay and cost constraints.This paper expands Breadth First Search(BFS) algorithm,and proposes a multiple feasible paths algorithm under delay constraints(KDCP).The KDCP algorithm is then extended as KEDCP to get paths under delay and cost constraints.Simulation result shows the two algorithms have well performance compared with other mimetic algorithms.