Solving The Multi-Constrained Path Selection Problem By Using Depth First Search

An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the number of independent routing constraints is more than one. EDFS solves the general k−constrained MCP problem with pseudo-polynomial time complexity O(m2 · EN + N2 ), where E and N are the number of links and nodes of a graph respectively, and m is the maximum number of feasible paths maintained for each destination. This is achieved by deducing potential feasible paths from knowledge of previous explorations, without re-exploring finished nodes and their descendants in the process of the DFS search. One unique property of EDFS is that the tighter the constraints are, the better the performance it can achieve, w.r.t. both time complexity and routing success ratio. Analysis and extensive simulation are conducted to study the performance of EDFS in finding feasible paths that satisfy multiple QoS constraint...

• Type: Conference
• Year: 2005
• Where: QSHINE
• Authors: Zhenjiang Li, J. J. Garcia-Luna-Aceves
• Keywords: Feasible Paths, Independent Routing Constraints, QSHINE 2005, Time Complexity, Wireless Networks