Multiconstrained QoS Routing: A Norm Approach

IEEE Transactions on Computers

Volumn 56, Issue 6, 2007, Pages 859-863

  Makki, S Kami ^b  

^a Arizona State University   (United States)

^b The University of Toledo   (United States)

Author keywords

approximation algorithms; multiple additive QoS parameters; QoS routing; scaled p norm

Indexed keywords

EID: 85008018493     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2007.1016     Document Type: Article

References (32)

1. L.L.H. Andrew and A.A.N.A. Kusuma, “Generalised Analysis of a QoS-Aware Routing Algorithm,” Proc. IEEE Globecom ‘98, pp. 1–6, 1998.
2. S. Chen and K. Nahrstedt, “On Finding Multi-Constrained Paths,” Proc. IEEE Int'l Conf. Comm. (ICC ‘98), pp. 874–879, 1998.
3. F. Ergun, R. Sinha, and L. Zhang, “An Improved FPTAS for Restricted Shortest Path,” Information Processing Letters, vol. 83, pp. 287–291, 2002.
4. G. Feng, C. Douligeris, K. Makki, and N. Pissinou, “Performance Evaluation of Delay-Constrained Least-Cost QoS Routing Algorithms Based on Linear and Nonlinear Lagrange Relaxation,” Proc. IEEE Int'l Conf. Comm. (ICC ‘02), pp. 2273–2278, 2002.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
6. A. Goel, K.G. Ramakrishnan, D. Kataria, and D. Logothetis, “Effficient Computation of Delay-Sensitive Routes from One Source to All Destinations,” Proc. IEEE Infocom ‘01, pp. 854–858, 2001.
7. G.H. Golub and C.F. Van Loan, Matrix Computations, second ed. The Johns Hopkins Univ. Press, 1989.
8. G.H. Hardy, J.E. Littlewood, G. Polya, Inequalities. Cambridge Univ. Press, 1952.
9. R. Hassin, “Approximation Schemes for the Restricted Shortest Path Problem,” Math. Operations Research, vol. 17, pp. 36–42, 1992.
10. J.M. Jaffe, “Algorithms for Finding Paths with Multiple Constraints,” Networks J., vol. 14, pp. 95–116, 1984.
11. X. Jia, “A Distributed Algorithm of Delay Bounded Multicast Routing for Multimedia Applications in Wide Area Networks,” IEEE/ACM Trans. Networking, vol. 6, pp. 828–837, 1998.
12. A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, “Lagrange Relaxation Based Method for the QoS Routing Problem,” Proc. IEEE Infocom ‘01, pp. 859–868, 2001.
13. P. Khadivi, S. Samavi, T.D. Todd, and H. Saidi, “Multi-Constraint QoS Routing Using a New Single Mixed Metric,” Proc. IEEE Int'l Conf. Comm. (ICC ‘04), pp. 2042–2046, 2004.
14. T. Korkmaz and M. Krunz, “A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements,” Computer Networks J., vol. 36, pp. 251–268, 2001.
15. T. Korkmaz and M. Krunz, “Multi-Constrained Optimal Path Selection,” Proc. IEEE Infocom ‘01, pp. 834–843, 2001.
16. W. Liu, W. Lou, and Y. Fang, “An Efficient Quality of Service Routing Algorithm for Delay-Sensitive Applications,” Computer Networks, vol. 47, pp. 87–104, 2005.
17. D.H. Lorenz and D. Raz, “A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem,” Operations Research Letters, vol. 28, pp. 213–219, 2001.
18. Q. Ma and P. Steenkiste, “Quality-of-Service Routing for Traffic with Performance Guarantees,” Proc. IEEE Int'l Workshop Quality of Service (IWQoS ‘97), May 1997.
19. A. Orda and A. Sprintson, “Efficient Algorithms for Computing Disjoint QoS Paths,” Proc. IEEE Infocom ‘04, pp. 727–738, 2004.
20. N.S.V. Rao and S.G. Batsell, “QoS Routing via Multiple Paths Using Bandwidth Reservation,” Proc. IEEE Infocom ‘98, pp. 11–18, 1998.
21. S. Siachalou and L. Georgiadis, “Efficient QoS Routing,” Computer Networks, vol. 43, pp. 351–367, 2003.
22. M. Song and S. Sahni, “Approximation Algorithms for Multiconstrained Quality-of-Service Routing,” IEEE Trans. Computers, vol. 55, pp. 603–617, 2006.
23. P. Van Meighem and F.A. Kuipers, “Concept of Exact QoS Routing Algorithms,” IEEE/ACM Trans. Networking, vol. 12, pp. 851–864, 2004.
24. P. Van Mieghem, H. De Neve, and F.A. Kuipers, “Hop-by-Hop Quality of Service Routing,” Computer Networks, vol. 37, pp. 407–423, 2001.
25. Z. Wang and J. Crowcroft, “Quality-of-Service Routing for Supporting Multimedia Applications,” IEEE J. Selected Areas in Comm., vol. 14, pp. 1228–1234, 1996.
26. A. Warburton, “Approximation of Pareto Optima in Multiple-Objective, Shortest Path Problem,” Operations Research, vol. 35, pp. 70–79, 1987.
27. Y. Xiao, K. Thulasiraman, and G. Xue, “QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming,” IEEE Trans. Computers, vol. 55, pp. 815–829, 2006.
28. G. Xue, “Primal-Dual Algorithms for Computing Weight-Constrained Shortest Paths and Weight-Constrained Minimum Spanning Trees,” Proc. IEEE Int'l Performance Computing and Comm. Conf. (IPCCC ‘00), pp. 271–277, 2000.
29. G. Xue, “Minimum Cost QoS Multicast and Unicast Routing in Communication Networks,” IEEE Trans. Comm., vol. 51, pp. 817–824, 2003.
30. G. Xue, A. Sen, and R. Banka, “Routing with Many Additive QoS Constraints,” Proc. IEEE Int'l Conf. Comm. (ICC ‘03), pp. 223–227, 2003.
31. G. Xue, A. Sen, W. Zhang, J. Tang, and K. Thulasiraman, “Finding a Path Subject to Many Additive QoS Constraints,” IEEE/ACM Trans. Networking, vol. 15, pp. 201–211, 2007.
32. X. Yuan, “Heuristic Algorithms for Multiconstrained Quality-of-Service Routing,” IEEE/ACM Trans. Networking, vol. 10, pp. 244–256, 2002.