Two Innovative Algorithms for Fast Computation of Constrained Shortest Paths

Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay-constrained path is critical for real-time data flows such as voice/video calls. Because it is NP-complete, much research has been designing heuristic algorithms that solve the - approximation of the problem with an adjustable accuracy. A common approach is to discretize (i.e., scale and round) the link delay or link cost, which transforms the original problem to a simpler one solvable in polynomial time.

Provided by: International Journal on Computer Science and Technology (IJCST) Topic: Mobility Date Added: Sep 2011 Format: PDF

Find By Topic