Reverse Optimization Algorithm for QoS Routing Problem

Crawley E, Nair R, Rajagopalan B, Sandick H. A framework for QoS-based Routing in the intemet. Intemet Draft, RFC2386,1998.[2]Guerin R, kamat S, Orda A, Przygienda T, Williams D. QoS routing mechanisms and OSPF extensions. Intemet Draft,RFC2676, 1998.[3]Wang Z, Crowcroft J. QoS routing for supporting resource reservation. IEEE J. on SAC, 1996, 14(9): 1228- 1234.[4]Sobrinho J. Algebra and algorithms for path computation and hop-by-hop routing in the internet[J].IEEE/ACM Trans. on the Networking.2002, 10(4):541-[5]Garey M, Johnson D. Computers and Intractability: A Guide to the Theory ofNP Completeness.[M]. San. Francisco, New York:W. H. Freeman, 1979, chp. 4.[6]Chen S, Nahrstedt K. An overview of quality of service routing for next-generation high-speed networks: Problems and Solutions[J].IEEE Network.1998, 12(6):64-[7]Warburton A. Approximation of Pareto optima in multipleobjective, shortest path problems[J].Operations Research.1987,35(1):70-[8]Hassin R. Approximation schemes for the restricted shortest path problems. Mathematics Operations Research, 1992, 17(1):136- 142.[9]Yuan. X. Heuristic algorithms for multiconstrained quality-ofservice routing[J].IEEE/ACM Trans. on the Networking.2002,10(2):244-[10]Cheng S.[J].Nahrstedt K. On finding multi-constrained paths [A].IEEE ICC98[C], Atlanta, GA.1998,:-[11]Jaffe J. Algorithms for finding paths with multiple constraints.Networks, 1984, (14): 95 - 116.[12]Neve H, Mieghem P. A multiple quality of service routing algorithm for PNNI.[A] Proceedings IEEE ATM Workshop[C],May 26-29, Fairfax, VA, 1998:324 - 328.[13]Korkmaz T, Krunz M. An efficient algorithm for finding a path subject to two additive constraints [J].Computer Communications Journal.2002, 25(3):225-