Finding multi-constrained feasible paths by using depth-first search
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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(m 2 · EN + N 2), where m is the maximum number of non-dominated paths maintained for each destination, E and N are the number of links and nodes of a graph, respectively. 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. This is valuable to highly dynamic environment such as wireless ad hoc networks in which network topology and link state keep changing, and real-time or multimedia applications that have stringent service requirements. EDFS is an independent feasible path searching algorithm and decoupled from the underlying routing protocol, and as such can work together with either proactive or on-demand ad hoc routing protocols as long as they can provide sufficient network state information to each source node. Analysis and extensive simulation are conducted to study the performance of EDFS in finding feasible paths that satisfy multiple QoS constraints. The main results show that EDFS is insensitive to the number of constraints, and outperforms other popular MCP algorithms when the routing constraints are tight or moderate. The performance of EDFS is comparable with that of the other algorithms when the constraints are loose.
- H. Badis and K. Agha, Quality of Service for Ad-hoc Optimized Link State Routing Protocol (QOLSR), IETF Internet Draft, draft-badis-manet-qolsr-01.txt, April 2005.
- S. Chen and K. Nahrstedt, Distributed Quality-of-Service Routing in Ad-Hoc Networks. IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8. (August 1999).
- S. Chen and K. Nahrstedt, On Finding Multi-constrained Paths. In Proceedings of IEEE International Conference of Communications (ICC'98), pp. 874–879. Springer-Verlag, June, 1998.
- T. Clausen and P. Jacquet, Optimized Link State Routing Protocol, IETF RFC 3626 (Experimental), October. 2003.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition. McGraw-Hill Companies, 2003.
- J.J. Garcia-Luna-Aceves and Marcelo Spohn. Transmission-Efficient Routing in Wireless Networks Using Link-State Information. Mob. Netw. Appl., Vol. 6, No. 3 (2001) pp. 223–238.
- J. M. Jaffe, Algorithms for Finding Paths with Multiple Constraints. IEEE Networks, 14:95–116, 1984.
- A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, Lagrange Relaxation Based Method for the QoS Routing Problem. In Proceedings of IEEE INFOCOM, 2001.
- T. Korkmaz, M. Krunz, and S. Tragoudas, An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints. In Proceedings of the ACM SIGMETRICS, pp. 318–327, 2000.
- F. A. Kuipers and P. V. Mieghem, The Impact of Correlated Link Weights on Qos Routing. In Proceedings of IEEE INFOCOM, 2003.
- X. Lin and N.B. Shroff, An Optimization Based Approach for QoS Routing in High-Bandwidth Networks. In Proceedings of IEEE INFOCOM, 2004.
- Q. Ma and P. Steenkiste, Quality-of-Service Routing for Traffic with Performance Guarantees. In Proceedings of the IFIP Fifth International Workshop on Quality of Service, pp. 115–126, May, 1997.
- P. V. Mieghem and F. A. Kuipers, Concepts of Exact Qos Routing Algorithms. IEEE/ACM Trans. Netw., Vol. 12, No. 5 (2004) pp. 851–864. CrossRef
- H. D. Neve and P. V. Mieghem, TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm. Computer Communications, Vol. 23 (2000) pp. 667–679. CrossRef
- C. Perkins, E. Royer, and S. Das, Quality of Service in Ad-hoc On-demand Distance Vector Routing, IETF Internet Draft (work in progress), draft-perkins-manet-aodvqos-00.txt, July 2000.
- C. Perkins, E. Royer, and S. Das, Ad Hoc On Demand Distance Vector (AODV) Routing, IETF RFC 3561 (Experimental). July 2003.
- H. Rangarajan and J.J. Garcia-Luna-Aceves, Using Labeled Paths for Loop-free On-demand Routing in Ad Hoc Networks. In Proceedings of the 5th ACM International Symposium on Mobile ad hoc Networking and Computing (MobiHoc'04), pp. 43–54, Roppongi Hills, Tokyo, Japan, 2004. ACM Press.
- B. Smith and J.J. Garcia-Luna-Aceves, Efficient Policy-Based Routing without Virtual Circuits. In Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'04), Dallas, Texas, October, 2004.
- Z. Wang and J. Crowcroft, Quality-of-Sservice Routing for Supporting Multimedia Applications. IEEE Journal of Selected Areas in Communications, Vol. 14, No. 7 (1996) pp. 1228–1234. CrossRef
- X. Yuan, Heuristic Algorithms for Multiconstrained Quality-of-Service Routing. IEEE/ACM Trans. Netw., Vol. 10, No. 2 (2002) 244–256. CrossRef
- Finding multi-constrained feasible paths by using depth-first search
Volume 13, Issue 3 , pp 323-334
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Multi-constrained path selection
- Depth-first search
- Success ratio
- Existence percentage
- Competitive ratio
- Industry Sectors