An efficient algorithm for finding a path subject to two additive constraints
Tài liệu tham khảo
Ahuja, 1993
Aneja, 1983, Shortest chain subject to side constraints, Networks, 13, 295, 10.1002/net.3230130212
G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda, T. Przygienda, QoS routing mechanisms and OSPF extensions. Technical Report RFC 2676, IETF, August 1999.
Apostolopoulos, 1998
Blokh, 1996, An approximate algorithm for combinatorial optimization problems with two parameters, Australasian Journal of Combinatorics, 14, 157
Chen, 1998
Chen, 1998, An overview of quality-of-service routing for the next generation high-speed networks: problems and solutions, IEEE Network, 12, 64, 10.1109/65.752646
Clark, 1996, Strategic directions in networks and telecommunications, ACM Computing Surveys, 28, 579, 10.1145/242223.242273
Comer, 1995, vol. I
Cormen, 1996
E. Crawley, R. Nair, B. Rajagopalan, H. Sandick, A Framework for QoS-based Routing in the Internet, RFC 2386, IETF, August 1998.
De Neve, 1998
Eppstein, 1994
The ATM Forum. Private network-to-network interface specification version 1.0 (PNNI 1.0), March 1996. af-pnni-0055.000.
Garey, 1979
Guerin, 1999, QoS routing in networks with inaccurate information: theory and algorithms, IEEE/ACM Transactions on Networking, 7, 350, 10.1109/90.779203
Guo, 1999
Hassin, 1992, Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research, 17, 36, 10.1287/moor.17.1.36
Ishida, 1998
Iwata, 1996, ATM routing algorithms with multiple QOS requirements for multimedia internetworking, IEICE Transactions and Communications, E79-B, 999
Jaffe, 1984, Algorithms for finding paths with multiple constraints, Networks, 14, 95, 10.1002/net.3230140109
Korkmaz, 2001, A randomized algorithm for finding a path subject to multiple QoS constraints, Computer Networks Journal, 36, 251, 10.1016/S1389-1286(00)00209-7
Lee, 1997, 2
Lee, 1995, Routing subject to quality of service constraints in integrated communication networks, IEEE Network, 46, 10.1109/65.397043
Ma, 1997
Ma, 1998
Orda, 1999, Routing with end-to-end QoS guarantees in broadband networks, IEEE/ACM Transactions on Networking, 7, 365, 10.1109/90.779205
Pornavalai, 1997
Reeves, 2000, A distributed algorithm for delay-constrained unicast routing, IEEE/ACM Transactions on Networking, 8, 239, 10.1109/90.842145
Skiscim, 1989, Solving k-shortest and constrained shortest path problems efficiently, Annals of Operations Research, 20, 249, 10.1007/BF02216932
Sun, 1998, distributed routing algorithm for supporting delay-sensitive applications, Computer Communications, 21, 572, 10.1016/S0140-3664(98)00127-3
Taft-Plotkin, 1999
Vogel, 1996, QoS-based routing of multimedia streams in computer networks, IEEE Journal on Selected Areas in Communications, 14, 1235, 10.1109/49.536365
Wang, 1996, Quality-of-service routing for supporting multimedia applications, IEEE Journal on Selected Areas in Communications, 14, 1228, 10.1109/49.536364
R. Widyono, The design and evaluation of routing algorithms for real-time channels. Technical Report TR-94-024, University of California at Berkeley and International Computer Science Institute, June 1994.
Xiao, 1999, Internet QoS: a big picture, IEEE Network, 13, 8, 10.1109/65.768484