Bandwidth-delay constrained path selection under inaccurate state information

IEEE/ACM Transactions on Networking

Volumn 11, Issue 3, 2003, Pages 384-398

  Korkmaz, Turgay ^a   Krunz, Marwan ^b  

^a University of Texas at San Antonio   (United States)

^b University of Arizona   (United States)

Author keywords

Lagrange relaxation; Multiobjective optimization; Quality of service (QoS) routing; Stochastic shortest path

Indexed keywords

BANDWIDTH; CONSTRAINT THEORY; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; QUALITY OF SERVICE;

CONSTRAINED PATH;

COMPUTER NETWORKS;

EID: 0038155502     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2003.813047     Document Type: Article

References (41)

1. S. Chen and K. Nahrstedt, "An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions," IEEE Network, vol. 12, pp. 64-79, Nov/Dec. 1998.
2. F. A. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem. (2002) A review of constraint-based routing algorithms. Tech. Univ. Delft, Delft, The Netherlands. [Online]. Available: http://wwwtvs.et.tudelft.nl/people/fernando/papers/TRreviewqosalg.pdf
3. A. Shaikh, J. Rexford, and K. G. Shin, "Evaluating the impact of stale link state on quality-of-service routing," IEEE/ACM Trans. Networking, vol. 9, pp. 162-176, Apr. 2001.
4. D. H. Lorenz and A. Orda, "QoS routing in networks with uncertain parameters," IEEE/ACM Trans. Networking, vol. 6, pp. 768-778, Dec. 1998.
5. J. Moy, "OSPF version 2," IETF, Standards Track RFC 2328, Apr. 1998.
6. G. Apostolopoulos, R. Guerin, S. Kamat, and S. K. Tripathi, "Quality of service based routing: A performance perspective," in Proc. ACM SIGCOMM, Vancouver, BC, Canada, Aug./Sept. 1998, pp. 17-28.
7. "Private network-to-network interface specification version 1.0 (PNNI 1.0)," The ATM Forum, Mar. 1996.
8. T. Korkmaz and M. Krunz, "Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks," ACM Trans. Modeling and Computer Simulation (TOMACS), vol. 10, no. 4, pp. 295-325, Oct. 2000.
9. G. Apostolopoulos, D. Williams, S. Kamat, A. Guerin, R. Orda, and T. Przygienda, "QoS routing mechanisms and OSPF extensions," IETF, RFC 2676, Aug. 1999.
10. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE J. Select. Areas Commun., vol. 14, pp. 1228-1234, Sept. 1996.
11. H. Frank, "Shortest paths in probabilistic graphs," Oper. Res., vol. 17, pp. 583-599, 1969.
12. P. Hansen, "Bicriterion path problems," in Multiple Criteria Decision Making; Theory and Applications, G. Fandel and T. Gal, Eds. Heidelberg, Germany: Springer, 1980, pp. 109-127. Lectures Notes in Economics and Mathematical Systems 177.
13. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, New York: Holt, Rinehart and Winston, 1976.
14. R. Guerin and A. Orda, "QoS routing in networks with inaccurate information: Theory and algorithms," IEEE/ACM Trans. Networking, vol. 7, pp. 350-364, June 1999.
15. G. Apostolopoulos, R. Guerin, S. Kamat, and S. Tripathi, "Improving QoS routing performance under inaccurate link state information," in Proc. 16th Int. Teletraffic Congr. (ITC' 16), Edinburgh, U.K., June 1999, pp. 1351-1362.
16. Y. Jia, I. Nikolaidis, and P. Gburzynski, "Multiple path routing in networks with inaccurate link state information," in Proc. IEEE Int. Conf. Communications, vol. 8, 2001, pp. 2583-2587.
17. W. Jianxin, W. Weiping, C. Jianer, and C. Songqiao, "A randomized QoS routing algorithm on networks with inaccurate link-state information," in IEEE Int. Conf. Communication Technology (WCC-ICCT 2000), vol. 2, 2000, pp. 1617-1622.
18. R. P. Loui, "Optimal paths in graphs with stochastic or multidimensional weights," Commun. ACM, vol. 26, no. 9, pp. 670-676, 1983.
19. M. I. Henig, "The shortest path problem with two objective functions," Eur. J. Oper. Res., vol. 25, no. 2, pp. 281-291, 1986.
20. P. B. Mirchandani, "Shortest distance and reliability of probabilistic networks," Comput. Oper. Res., vol. 3, pp. 347-355, 1976.
21. C. E. Sigal, A. A. B. Pritsker, and J. J. Solberg, "Stochastic shortest route problem," Oper. Res., vol. 28, no. 5, pp. 1122-1129, Sept./Oct. 1980.
22. J. Kamburowski, "A note on the stochastic shortest route problem," Oper. Res., vol. 33, no. 3, pp. 696-698, May/June 1985.
23. G. H. Polychronopoulos and J. N. Tsitsiklis, "Stochastic shortest path problems with recourse," Oper. Res. Lett., vol. 10, pp. 329-334, Aug. 1991.
24. R. A. Sivakumar and R. Batta, "The variance-constrained shortest path problem," Transport. Sci., vol. 28, no. 4, pp. 309-316, Nov. 1994.
25. E. D. Miller-Hooks and H. S. Mahmassani, "Least expected time paths in stochastic, time-varyin'g transportation networks," Transport. Sci., vol. 34, no. 2, pp. 198-215, May 2000.
26. S. Sen, R. Pillai, S. Joshi, and A. K. Rathi, "A mean-variance model for route guidance in advanced traveler information systems," Transport. Sci., vol. 35, no. 1, pp. 37-49, Feb. 2001.
27. R. K. Cheung, "Iterative methods for dynamic stochastic shortest path problems," Naval Res. Logistics, vol. 45, pp. 769-789, 1998.
28. A. Eiger, P. B. Mirchandani, and H. Soroush, "Path preferences and optimal paths in probabilistic networks," Transport. Sci., vol. 19, no. 1, pp. 75-84, Feb. 1985.
29. P. B. Mirchandani and H. Soroush, "Optimal paths in probabilistic networks: A case with temporal preferences," Comput. Oper. Res., vol. 12, no. 4, pp. 365-381, 1985.
30. I. Murthy and S. Sarkar, "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," Eur. J. Oper. Res.,.vol. 103, pp. 209-229, 1997.
31. _, "Stochastic shortest path problems with piecewise-linear concave utility functions," Manage. Sci., vol. 44, no. 11, pp. S125-S136, Nov. 1998.
32. Smooth Functions [Online]. Available: http://www.maths.adelaide.edu.au/pure/mmurray/dg_hons/node4.html
33. Smooth Function [Online]. Available: http://mathworld.wolfram.com/SmoothFunction.html
34. D. E. McDysan, QoS and Traffic Management in IP and ATM Networks. New York: McGraw-Hill, 2000.
35. A. Papoulis, Probability, Random Variables, Stochastic Processes, 3rd ed. New York: McGraw-Hill, 1991.
36. T. Elteto and S. Molnar, "On the distribution of round-trip delays in TCP/IP networks," in Proc. IEEE Local Computer Networks Conf., 1999. pp. 172-181.
37. T. Korkmaz, M. Krunz, and S. Tragoudas, "An efficient algorithm for finding a path subject to two additive constraints," in Proc. ACM SIGMETRICS, vol. 1, June 2000, pp. 318-327.
38. E. I. Chong, S. R. Maddila, and S. T. Morley, "On finding single-source single-destination k shortest paths," in Proc. 7th Int. Conf. Computing and Information (ICCI'95), July 1995, pp. 40-47.
39. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "Power-laws of the Internet topology," in Proc, ACM SIGCOMM, Cambridge, MA, Sept. 1999, pp. 251-262.
40. BRITE: Boston University Representative Internet Topology Generator. [Online]. Available: http://www.cs.bu.edu/brite/
41. J. T. Moy, OSPF: Complete Implementation (with CD-ROM). Reading, MA: Addison-Wesley, 2000.