New Routing Strategies for RSP Problems with Concave Cost

Multi-Constraint Path (MCP) and Restricted Shortest Path (RSP) are important problems studied in the field of QoS routing. Traditional versions of these problems are known to be NP-Complete ones. Various solutions have been proposed for RSP and MCP based on different heuristics, in practical situations. Restricted shortest path problem with concave route costs is studied in this paper. This is a special version of the traditional RSP problem and is widely applicable in wireless and mobile ad hoc networks. In this paper, we propose new algorithms for this kind of routing. The effectiveness and performance of our proposed solutions are shown through simulations.

[1]  Zheng Wang,et al.  Internet QoS: Architectures and Mechanisms for Quality of Service , 2001 .

[2]  Terence D. Todd,et al.  Multi-constraint QoS routing using a new single mixed metric , 2004, ICC.

[3]  Shadrokh Samavi,et al.  Restricted Shortest Path Routing with Concave Costs , 2006, IEEE International Conference on Computer Systems and Applications, 2006..

[4]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[6]  Terence D. Todd,et al.  MOBILE AD HOC RELAYING IN HYBRID WLAN/CELLULAR SYSTEMS FOR DROPPING PROBABILITY REDUCTION , 2004 .

[7]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[8]  Nirwan Ansari,et al.  Achieving 100% success ratio in finding the delay constrained least cost path , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[9]  Halim Yanikomeroglu,et al.  Relayer selection strategies in cellular networks with peer-to-peer relaying , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).