Heuristic algorithms for path selection in private ATM networks

The path selection problem is formulated as a shortest path problem with multiple constraints which is known to be NP-complete. We propose heuristic algorithms to find a minimum hop path satisfying the constraints of end-to-end delay requirement, maximum load level on each of its link and minimum probability to pass the local call admission control. The spirit of the proposed heuristic is to transform the constrained shortest path problem into an unconstrained shortest path problem. Simulation study over a large number of randomly generated networks shows that in most cases it is better than existing heuristic algorithms in terms of the call blocking ratio