On selecting the cost function for source routing

Many proposed source routing algorithms tackle the Multiple Additively Constrained Path (MACP) selection, an NP-complete problem, by transforming it into the shortest path selection problem, which is P-complete, with an integrated cost function that maps the multi-constraints of each link into a single cost. However, how to select an appropriate cost function is an important issue that has rarely been addressed in literature. In this paper, we provide a theoretical framework for picking a cost function that can improve the performance of source routing in terms of complexity, convergence, and probability of finding a feasible path.

[1]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Bal Azs.  Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .

[3]  Wang Jianxin,et al.  A randomized QoS routing algorithm on networks with inaccurate link-state information , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[4]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[5]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[6]  Ariel Orda,et al.  Precomputation schemes for QoS routing , 2003, TNET.

[7]  Nirwan Ansari,et al.  A theoretical framework for selecting the cost function for source routing , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[8]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2000, SIGMETRICS '00.

[9]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

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

[11]  Marwan Krunz,et al.  Routing multimedia traffic with QoS guarantees , 2003, IEEE Trans. Multim..

[12]  Anees Shaikh,et al.  Evaluating the impact of stale link state on quality-of-service routing , 2001, TNET.

[13]  Liang Guo,et al.  Search space reduction in QoS routing , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).