A QoS Routing Algorithm by Applying Simulated Annealing

As a challenging problem of the upcoming next-generation networks, multi-constrained quality-of- service routing (QoSR) is to find a feasible path that satisfies the multiple constraints simultaneously. For the NP complete problem, the heuristic SA_MCP by applying the simulated annealing to Dijkstra's algorithm is proposed. SA_MCP first uses a non-linear energy function to convert multiple QoS weights to a single metric and then seeks to find a feasible path by simulated annealing. This paper overviews the simulated annealing method and analyzes the issues when it is applied to QoSR. Extensive simulations show the following conclusions: (1) SA_MCP has a high performance w.r.t. routing success ratio. (2) It has a good scalability in both network scale and weight number k. (3) It is insensitive to the distribution of QoS constraints. Furthermore, when most QoS requests are feasible, the running time of SA_MCP is about O(k(m+nlogn)), which is k times that of the traditional Dijkstra's algorithm.

[1]  Niki Pissinou,et al.  Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear Lagrange relaxation , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

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

[4]  Cui Yong.  Research on Internetwork QoS Routing Algorithms: a Survey , 2002 .

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

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

[7]  Klara Nahrstedt,et al.  Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[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]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[11]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

[12]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[13]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[14]  Ian F. Akyildiz,et al.  A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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