An effective approximation scheme for multiconstrained quality-of-service routing

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2010, Pages

  Huang, Jun ^a   Huang, Xiaohong ^a   Ma, Yan ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; ITERATIVE METHODS; QUALITY OF SERVICE;

'CURRENT; APPROXIMATION SCHEME; AUXILIARY GRAPH; MULTIPLE QUALITY; OPTIMAL PROBLEMS; PROBLEM-BASED; QUALITY OF SERVICE CONSTRAINTS; QUALITY OF SERVICE ROUTING; QUALITY-OF-SERVICE; SERVICE REQUIREMENTS;

POLYNOMIAL APPROXIMATION;

EID: 79551632991     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2010.5683581     Document Type: Conference Paper

References (17)

1. J. Huang and Y. Liu, "MOEAQ: A QoS-Aware Multicast Routing Algorithm for MANET," Exp. Sys. with App., vol. 37, no. 2, Mar. 2010, pp. 1391-1399.
2. S. Chen, "Two techniques for fast computation of constrained shortest paths," IEEE/ACM Trans. Netw., vol. 16, no. 1, Feb. 2008, pp. 105-115.
3. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE J. Sel. Areas. Com., vol. 14, no. 7, Sept. 1996, pp. 1228-1234.
4. S. Sahni, "General techniques for combinatorial approximation," Oper. Res., vol. 25, no. 6, Nov./Dec. 1977, pp. 920-936.
5. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," IEEE ICC98, pp. 874-879.
6. G. Xue, "Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees," IEEE IPCCC00, Feb. 2000, pp. 271-277.
7. A. Juttner,B. Szviatovszki, I. Mecs, and Z. Rajko, "Lagrange relaxation based method for the QoS routing problem," IEEE INFOCOM 2001, pp. 859-868.
8. T.Korkmaz and M. Krunz, "Multi-constrained optimal path selection," IEEE INFOCOM 2001, pp. 834-843.
9. F.A. Kuipers, P.V. Mieghem, T. Korkmaz and M. Krunz, "An Overview of Constraint-Based Path Selection Algorithms for QoS Routing," IEEE Com. Mag., vol. 40, no. 12, Dec. 2002, pp. 50-55.
10. A.Warburton, "Approximation of Pareto optima in multiple-objective, shortest path problem," Oper. Res., vol. 35, no. 1, 1987, pp. 70-79.
11. R. Hassin, "Approximation schemes for the restricted shortest path problem," Math. Oper. Res., vol. 17, no. 1, 1992, pp. 36-42.
12. D.H. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest path problem," Oper. Res. Lett., vol. 28, no. 5, 2001, pp. 213-219.
13. G. Xue, A. Sen, W. Zhang, J. Tang and K. Thulasiraman, "Finding a path subject to many additive QoS constraints," IEEE/ACM Trans. Netw., vol. 15, no. 1, 2007, pp. 201-211.
14. G. Xue, W. Zhang, J. Tang and K. Thulasiraman, "Polynomial time approximation algorithms for multi-constrained QoS routing," IEEE/ACM Trans. Netw., vol. 16, no. 3, 2008, pp. 656-669.
15. P.V. Mieghem and F.A. Kuipers, "Concepts of Exact QoS Routing Algorithms," IEEE/ACM Trans. Netw., vol. 12, no. 5, 2004, pp. 851-864.
16. A. Orda and A. Sprintson, "Precomputation schemes for QoS routing," IEEE/ACM Trans. Netw., vol. 11, no. 4, Aug. 2003, pp. 578-591.
17. BRITE; http://www.cs.bu.edu/brite/.