Quality of service routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2856, Issue , 2003, Pages 80-117

  Van Mieghem, P ^a   Kuipers, F A ^a   Korkmaz, T ^b   Krunz, M ^c   Curado, M ^d   Monteiro, E ^d   Masip Bruin, X ^e   Sole Pareta J ^e   Sanchez Lopez S ^e  

^a Delft University of Technology ^*  (Netherlands)

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

^c University of Arizona   (United States)

^d UNIVERSITY OF COIMBRA   (Portugal)

^e UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248857064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45190-7_3     Document Type: Article

References (99)

1. L.H. Andrew and A.A.N. Kusuma, "Generalized analysis of a qos-aware routing algorithm," Proc. of IEEE GLOBECOM 1998, Piscataway, NJ, USA, vol. 1, pp. 1-6, 1998.
2. T. Anjali, C. Scoglio, J. de Oliveira, L.C. Chen, I.F. Akyldiz, J.A. Smith, G. Uhl, A. Sciuto, "A new path selection algorithm for MPLS networks based on available bandwidth estimation," Proc. of QofIS 2002, pp.205-214, Zurich, Switzerland, October 2002.
3. G. Apostolopoulos, R. Guerin, S. Kamat and S.K. Tripathi, "Quality of service based routing: a performance perspective," Proc. of ACM SIGCOMM '98, Vancouver, British Columbia, Canada, pp. 17-28, August/September, 1998.
4. G. Apostolopoulos, R. Guerin, S. Kamat and S.K. Tripathi, "Server based qos routing," Proc. of IEEE GLOBECOM 1999, 1999.
5. G. Apostolopoulos, D. Williams, S. Kamat, R. Guerin, A. Orda and T. Przygienda, "QoS routing mechanisms and OSPF extensions," RFC 2676, August 1999.
6. G. Apostolopoulos, R. Guerin, S. Kamat, and S. Tripathi, "Improving qos routing performance under inaccurate link state information," Proc. of the 16th International Teletraffic Congress (ITC '16), Edinburgh, United Kingdom, June 7-11, 1999.
7. The ATM Forum, "Private network-to-network interface specification version 1.1 (PNNI 1.1)," af-pnni-0055.002, April 2002.
8. E. Basturk and P. Stirpe, "A hybrid spanning tree algorithm for efficient topology distribution in PNNI," Proc. of the 1st IEEE International Conference on ATM (ICATM '98), pages 385-394, 1998.
9. B. Bellur and R.G. Ogier, "A reliable, efficient topology broadcast protocol for dynamic networks," IEEE INFOCOM'99, volume 1, pages 178-186, 1999.
10. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang and W. Weiss, "An architecture for differentiated services," RFC 2475, December 1998.
11. R. Braden, D. Clark and S. Shenker, "Integrated services in the internet architecture: an overview," RFC 1633, June 1994.
12. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," Proc. of ICC '98, New York, pp. 874-879, 1998.
13. S. Chen and K. Nahrstedt, "Distributed qos routing with imprecise state information," Proc. of 7th IEEE International Conference of Computer, Communications and Networks, Lafayette, LA, pp. 614-621, October 1998.
14. T.M. Chen and T.H. Oh, "Reliable services in MPLS," IEEE Communications Magazine, pp. 58-62, 1999.
15. R.K. Cheung, "Iterative methods for dynamic stochastic shortest path problems," Naval Research Logistics, no. 45, pp. 769-789, 1998.
16. M. Curado, O. Reis, J. Brito, G. Quadros and E. Monteiro, "Stability and sealability issues in hop-by-hop class-based routing," Proc. of the 2nd International Workshop on QoS in Multiservice IP Networks (QoS-IP2003), Milano, Italy, February 24-26, 2003.
17. E.I. Chong, S. Maddila and S. Morley, "On finding single-source single-destination k shortest paths," J. Computing and Information, special issue ICCI'95, pp. 40-47, 1995.
18. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 2000.
19. Y.K. Dalal and R.M. Metcalfe, "Reverse path forwarding of broadcast packets," Communications of the ACM, no. 21, pp. 1040-1048, December 1978.
20. H. De Neve and P. Van Mieghem, "A multiple quality of service routing algorithm for PNNI," IEEE ATM workshop, Fairfax, pp. 324-328, May 26-29, 1998.
21. H. De Neve and P. Van Mieghem, "TAMCRA: a tunable accuracy multiple constraints routing algorithm," Computer Communications, vol. 23, pp. 667-679, 2000.
22. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, no. 1, pp. 269-271, 1959.
23. A. Eiger, P.B. Mirchandani, and H. Soroush, "Path preferences and optimal paths in probabilistic networks," Transportation Science, vol. 19, no. 1, pp. 75-84, February 1985.
24. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," IEEE INFOCOM 2000, vol. 2, pp. 519-528, 2000.
25. H. Frank, "Shortest paths in probabilistic graphs," Oper. Res., vol. 17, 583-599, 1969.
26. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
27. G.H. Golub and C.F. Van Loan, Matrix Computations, 1st ed., North Oxford Academic, Oxford, 1983.
28. R. Guerin and A. Orda, "QoS routing in networks with inaccurate information: theory and algorithms," IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 350-364, June 1999.
29. R. Guerin and A. Orda, "Networks with advance reservations: the routing perspective," IEEE INFOCOM 2000, Israel, March 26-30, 2000.
30. L. Guo and I. Matta, "Search space reduction in qos routing", Proc. of the 19th III Int. Conference on Distributed Computing Systems, III, pp. 142-149, May 1999.
31. Y. Guo, F. A. Kuipers and P. Van Mieghem, 2003, "A Link-Disjoint Paths Algorithm for Reliable QoS Routing", to appear in International Journal of Communication Systems.
32. R. Hassin, "Approximation schemes for the restricted shortest path problem," Mathematics of Operations Research, vol. 17, no. 1, pp. 36-42, 1992.
33. M.I. Henig, "The shortest path problem with two objective functions," European J. of Operational Research, vol. 25, pp. 281-291, 1985.
34. P.A. Humblet and S.R. Soloway, "Topology broadcast algorithms," Computer Networks and ISDN Systems, vol. 16, 179-186, 1988/89.
35. A. Iwata, R. Izmailov, D.-S. Lee, B. Sengupta, G. Ramamurthy and H. Suzuki, "ATM routing algorithms with multiple qos requirements for multimedia internet-working," IEICE Transactions and Communications E79-B, no. 8, pp. 999-1006, 1996.
36. J.M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, no. 14, pp. 95-116, 1984.
37. Y. Jia, I. Nikolaidis and P. Gburzynski, "Multiple path routing in networks with inaccurate link state information," IEEE ICC, vol. 8, pp. 2583-2587, 2001.
38. W. Jianxin, W. Weiping, C. Jianer and C. Songqiao, "A randomized qos routing algorithm on networks with inaccurate link-state information," Proc. of the International Conference on Communication Technology (WCC - ICCT 2000), vol. 2, pp. 1617-1622, 2000.
39. A. Juttner, B. Szviatovszki, I. Mecs and Z. Rajko, "Lagrange relaxation based method for the qos routing problem," IEEE INFOCOM 2001, vol. 2, pp. 859-868, April 2001.
40. J. Kamburowski, "A note on the stochastic shortest route problem," Operations Research, vol. 33, no. 3, pp. 696-698, May-June 1985.
41. S. Keshav, An Engineering Approach to Computer Networking: ATM networks, the Internet, and the Telephone Network, Addison-Wesley, 1997.
42. A. Khanna and J. Zinky, "The revised ARPANET routing metric," SIGCOMM'89, 1989.
43. S. Kim and M. Lee, "Server based qos routing with implicit network state updates," IEEE GLOBECOM 2001, vol.4, pp. 2182-2187, San Antonio, Texas, November 2001.
44. M. Kodialam and T.V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," IEEE INFOCOM 2000, pp. 902-911, 2000.
45. T. Korkmaz and M. Krunz, "Source-oriented topology aggregation with multiple qos parameters in hierarchical networks," The ACM Transactions on Modeling and Computer Simulation (TOMACS), vol. 10, no. 4, pp. 295-325, October 2000.
46. T. Korkmaz and M. Krunz, "Hybrid flooding and tree-based broadcasting for reliable and efficient link-state dissemination," IEEE GLOBECOM '02 Conference - High-Speed Networks Symposium, November 2002.
47. T. Korkmaz and M. Krunz, "Bandwidth-delay constrained path selection under inaccurate state information," to appear in IEEE/ACM Transactions on Networking, 2003.
48. T. Korkmaz and M. Krunz, "A randomized algorithm for finding a path subject to multiple qos requirements," Computer Networks, vol. 36, pp. 251-268, 2001.
49. T. Korkmaz and M. Krunz, "Multi-constrained optimal path selection," IEEE INFOCOM, 2001.
50. F.A. Kuipers and P. Van Mieghem, "QoS routing: average complexity and hopcount in m dimensions," Proc. of Second COST 263 International Workshop, QofIS 2001, Coimbra, Portugal, pp. 110-126, September 24-26, 2001.
51. F.A. Kuipers and P. Van Mieghem, "MAMCRA: a constrained-based multicast routing algorithm," Computer Communications, vol. 25/8, pp. 801-810, May 2002.
52. F. A. Kuipers and P. Van Mieghem, "The impact of correlated link weights on qos routing", IEEE INFOCOM, San Francisco, USA, April 2003.
53. F.A. Kuipers and P. Van Mieghem, "Bi-directional search in qos routing," accepted to 4th Cost 263 International Workshop on Quality of Future Internet Services (QofIS 2003), Stockholm, Sweden, October 1-3, 2003.
54. E.L. Lawler, Combinatorial Optimization: networks and matroids, New York: Holt, Rinehart and Winston, 1976.
55. W.C. Lee, M.G. Hluchyi and P.A. Humblet, "Routing subject to quality of service constraints in integrated communication networks," IEEE Network, pp. 46-55, July/ August, 1995.
56. B. Lekovic and P. Van Mieghem, "Link state update policies for quality of service routing," IEEE Eighth Symposium on Communications and Vehicular Technology in the Benelux (SCVT2001), Delft, The Netherlands, pp. 123-128, October 18, 2001.
57. G. Liu and K.G. Ramakrishnan, "A*Prune: an algorithm for finding K shortest paths subject to multiple constraints," IEEE INFOCOM, 2001.
58. R.P. Loui, "Optimal paths in graphs with stochastic or multidimensional weights," Communications of ACM, vol. 26, no. 9, pp. 670-676, 1983.
59. D.H. Lorenz and A. Orda, "QoS routing in networks with uncertain parameters," IEEE/ACM Transactions on Networking, vol.6, no. 6, pp. 768-778, December 1998.
60. Q. Ma and P. Steenkiste, "Quality-of-service routing with performance guarantees," Proc. of 4th Int. IFIP Workshop on QoS, May 1997.
61. Q. Ma and P. Steenkiste, "Supporting dynamic inter-class resource sharing: a multi-class qos routing algorithm," IEEE INFOCOM, 1999.
62. Z. Ma, P. Zhang and R. Kantola, "Influence of link state updating on the performance and cost of qos routing in an intranet," 2001 IEEE Workshop on High Performance Switching and Routing (HPSR 2001), Dallas, Texas USA, May 29-31, 2001.
63. X. Masip-Bruin, S. Sánchez-López, J. Solé-Pareta, J. Domingo-Pascual, "A qos routing mechanism for reducing inaccuracy effects," Proc. of QoS-IP, Milan, Italy, February 2003.
64. X. Masip-Bruin, S. Sánchez-López, J. Solé-Pareta, J. Domingo-Pascual, "QoS routing algorithms under inaccurate routing information for bandwidth constrained applications, " Proceedings of International Communications Conference, IEEE ICC'03, Anchorage, Alaska, May 2003.
65. E.D. Miller-Hooks and H.S. Mahmassani, "Least expected time paths in stochastic, time-varying transportation networks," Transportation Science, vol. 34, no. 2, pp. 198-215, May 2000.
66. P.B. Mirchandani, "Shortest distance and reliability of probabilistic networks," Comput. & Ops. Res., vol. 3, pp. 347-355, 1976.
67. P.B. Mirchandani and H. Soroush, "Optimal paths in probabilistic networks: a case with temporal preferences," Comput. and Operations Research, vol. 12, no. 4, pp. 365-381, 1985.
68. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
69. I. Murthy and S. Sarkar, "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," European Journal of Operational Research, vol. 103, pp. 209-229, 1997.
70. I. Murthy and S. Sarkar, "Stochastic shortest path problems with piecewise-linear concave utility functions," Management Science, vol. 44, no. 11, pp. S125-S136, Nov. 1998.
71. K. Nahrstedt and S. Chen, "Coexistence of qos and best effort flows - routing and scheduling," Proc. of 10th IEEE Tyrrhenian International Workshop on Digital Communications: Multimedia Communications, Ischia, Italy, September, 1998.
72. S. Nelakuditi, Z. Zhang and R.P. Tsang, "Adaptive proportional routing: a localized qos routing approach," IEEE INFOCOM 2000, pp. 1566-1575, 2000.
73. M. Oliveira, J. Brito, B. Melo, G. Quadros and E. Monteiro, "Quality of service routing in the differentiated services framework," Proc. of SPIE's International Symposium on Voice, Video, and Data Communications (Internet III: Quality of Service and Future Directions), Boston, Massachusetts, USA, November 5-8, 2000.
74. A. Orda, "Routing with end-to-end qos guarantees in broadband networks," IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 365-374, 1999.
75. A. Orda and A. Sprintson, "QoS routing: the precomputation perspective," IEEE INFOCOM 2000, pp. 128-136, 2000.
76. M. Peyravian and A.D. Kshemkalyani, "Network path caching: issues, algorithms and a simulation study," Performance Evaluation, vol. 20, no. 8, pp. 605-614, 1997.
77. G.H. Polychronopoulos and J.N. Tsitsiklis, "Stochastic shortest path problems with recourse," Operations Research Letters, vol. 10, pp. 329-334, August 1991.
78. D.S. Reeves and H.F. Salama, "A distributed algorithm for delay-constrained unicast routing," IEEE/ACM Transactions on Networking, vol. 8, no. 2, pp. 239-250, April 2000.
79. E. Rosen, A. Viswanathan and R. Callon, "Multiprotocol label switching architecture," RFC 3031, January 2001.
80. A. Shaikh, J. Rexford and K. Shin, "Load-sensitive routing of long-lived IP flows," ACM SIGCOMM'99, 1999.
81. H.F. Salama, D.S. Reeves and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks," IEEE JSAC, vol. 15, no. 3, pp. 332-345, April 1997.
82. S. Sen, R. Pillai, S. Joshi and A.K. Rathi, "A mean-variance model for route guidance in advanced traveler information systems," Transportation Science, vol. 35, no. 1, pp. 37-49, February 2001.
83. A. Schrijver, Combinatorial Optimization, Vol. A - Vol. C, Springer-Verlag, Berlin, 2003
84. C.E. Sigal, A.A.B. Pritsker and J.J. Solberg, "Stochastic shortest route problem," Operations Research, vol. 28, no. 5, pp. 1122-1129, Sept.-Oct. 1980.
85. R.A. Sivakumar and R. Batta, "The variance-constrained shortest path problem," Transportation Science, vol. 28, no. 4, pp. 309-316, Nov. 1994.
86. N. Taft-Plotkin, B. Bellur and R. Ogier, "Quality-of-service routing using maximally disjoint paths," Proc. of the Seventh International Workshop on Quality of Service (IWQoS'99), London, England, pp. 119-128, May/June, 1999.
87. P. Van Mieghem, H. De Neve and F.A. Kuipers, "Hop-by-hop quality of service routing," Computer Networks, vol. 37, no. 3-4, pp. 407-423, October 2001.
88. P. Van Mieghem, "Paths in the simple random graph and the Waxman graph," Probability in the Engineering and Informational Sciences (PEIS), vol. 15, pp. 535-555, 2001.
89. P. Van Mieghem, "Topology information condensation in hierarchical networks," Computer Networks, vol.. 31, no. 20, pp. 2115-2137, November, 1999.
90. P. Van Mieghem and H. De Neve, "Aspects of quality of service routing," Proc. of SPIE'98, Boston (USA), 3529A-05, Nov. 1-6, 1998.
91. P. Van Mieghem, "Estimation of an optimal PNNI topology," IEEE ATM Workshop, pp. 570-577, 1997.
92. S. Vutukury and J. J. Garcia-Luna-Aceves, "A simple approximation to minimum-delay routing," ACM SIGCOMM'99, 1999.
93. B. Wang and J.C. Hou, "Multicast routing and its qos extension: problems, algorithms, and protocols," IEEE Network, vol. 14, no. 1, pp. 22-36, Jan.-Feb 2000.
94. Z. Wang and J. Crowcroft, "Shortest path first with emergency exits," SIGCOMM'90, Philadelphia, USA, September 1990.
95. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE JSAC, vol. 14, no. 7, pp. 1228-1234, September, 1996.
96. J. Wang and K. Nahrstedt, "Hop-by-hop routing algorithms for premium-class traffic in diffserv networks," IEEE INFOCOM, 2002.
97. B.M. Waxman, "Routing of multipoint connections," IEEE JSAC, vol. 6, no. 9, pp. 1617-1622, December 1998.
98. X. Xiao and L.M. Ni, "Internet qos: a big picture," IEEE Network, vol. 13, no. 2, pp. 8-18, March-April 1999.
99. X. Yuan, "Heuristic algorithms for multiconstrained quality-of-service routing," IEEE/ACM Transactions on Networking, vol. 10, no. 2, April 2002.