Research on Internetwork QoS Routing Algorithms: a Survey

It is a challenging problem to provide QoS (quality-of-service) guarantee for the next-generation networks, among which QoSR (QoS routing) is one of the key issues. QoSR seeks to find a feasible path for QoS traffic with two objectives: (1) providing the QoS guarantee for QoS traffic, (2) maximizing the utilization of the whole network. However, some multi-constrained QoSR problems, which are NP-complete, can't be resolved accurately in polynomial time. Thus heuristics are studied extensively in recent years. Based on the weighted graph network model and QoS metrics, the basic concept of QoSR is introduced and the hot issues of the unicast QoSR heuristics are analyzed in this paper. QoSR algorithms can be classified into the several classes: polynomial non-heuristics, pseudo-polynomial non-heuristics, QoS metrics restriction, path subspace search, QoS metrics relation, cost functions study and possibility solution. After typical algorithms are analyzed, the summary and conparison are given for each of the above classes. The validity of algorithms is dissected in detail, including the routing loop problem, stale network state information, the impact of the network topologies and traffic models. Based on the validity analysis, a summary is given for the QoSR algorithms based on probability models. At last, key issues are pointed out to be further studied in the QoSR field.

[1]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[2]  Fang Hao,et al.  On scalable QoS routing: performance evaluation of topology aggregation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[5]  João L. Sobrinho.  Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet , 2002, TNET.

[6]  Klara Nahrstedt,et al.  Distributed QoS routing with imprecise state information , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[7]  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).

[8]  Peter Steenkiste,et al.  Supporting dynamic inter-class resource sharing: a multi-class QoS routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Ariel Orda,et al.  Optimal partition of QoS requirements on unicast paths and multicast trees , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[12]  João L. Sobrinho,et al.  Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[14]  Zhang Subing,et al.  A QoS routing algorithm based on ant algorithm , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[15]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[16]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[17]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in high-speed networks based on selective probing , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[19]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[20]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[21]  David Clark,et al.  Strategic directions in networks and telecommunications , 1996, CSUR.

[22]  Funda Ergün,et al.  QoS routing with performance-dependent costs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[23]  Srihari Nelakuditi,et al.  Adaptive proportional routing: a localized QoS routing approach , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[24]  Ariel Orda.  Routing with end-to-end QoS guarantees in broadband networks , 1999, TNET.

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

[26]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[27]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 2000, TNET.

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

[29]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

[30]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[31]  Xin Yuan.  On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[32]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[33]  Kang G. Shin,et al.  A distributed route-selection scheme for establishing real-time channels , 1995, HPN.

[34]  Alpár Jüttner,et al.  Lagrange relaxation based method for the QoS routing problem , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[35]  Roch Guérin,et al.  Implementation and performance measurements of QoS routing extensions to OSPF , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[36]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[37]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[38]  Xingming Liu,et al.  Heuristic algorithms for multi-constrained quality of service routing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[39]  Yuval Shavitt,et al.  Optimal partition of QoS requirements with discrete cost functions , 2000, IEEE Journal on Selected Areas in Communications.

[40]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[41]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[42]  Norio Shiratori,et al.  QoS based routing algorithm in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.