Approximation and heuristic algorithms for delay constrained path selection under inaccurate state information

Proceedings - First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine 2004

Volumn , Issue , 2004, Pages 130-137

  Xiao, Ying ^a   Thulasiraman, Krishnaiyan ^a   Xue, Guoliang ^b  

^a UNIVERSITY OF OKLAHOMA   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DELAY CONSTRAINED PATH SELECTION; HEURISTIC ALGORITHMS; STATE INFORMATION;

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; CONSTRAINT THEORY; HEURISTIC METHODS; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; QUALITY OF SERVICE;

TELECOMMUNICATION NETWORKS;

EID: 19644363874     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A. Goel, K. G. Ramakrishnan, D. Kataria and D. Logothetis, "Efficient computation of delay-sensitive routes from one source to all destinations," IEEE INFOCOM, 2001.
2. R.Hassin, "Approximation schemes for the restricted shortest path problem," Math. of Oper. Res., 17(1), 1992, pp.36-42.
3. A. Jüttner, B. Szviatovszki, I. Mécs and Z. Rajkó, "Lagrange relaxation based method for the QoS routing problem," IEEE INFOCOM-2001, pp. 859-868.
4. D. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest paths problem," Oper. Res. Lett., vol. 28, pp. 213-219, June 2001.
5. K. Mehlhorn and M. Ziegelmann, "Resource constrained shortest paths," Proc. 8th European Symposium on Algorithms (ESA2000).
6. Y. Xiao, K. Thulasiraman and G. Xue, "Equivalence, unification and generality of two approaches to the constrained shortest path problem with extension", Allerton conference, Oct., 2003, Urbana-Champaign, IL.
7. G. Xue, "Minimum-cost QoS multicast and unicast routing in communication networks," IEEE Trans. on Comm., vol. 51, no.5, May 2003, pp.817-824.
8. R. Guerin and A. Orda, "QoS routing in networks with inaccurate information: theory and algorithms," IEEE/ACM Trans. on Networking, vol. 7, pp. 350-364, June 1999.
9. T. Korkmaz and M. Krunz, "Bandwidth-delay constrained path selection under inaccurate state information," IEEE/ACM Trans. on Networking, June 2003.
10. D. H. Lorenz and A. Orda, "QoS routing in networks with uncertain parameters," IEEE/ACM Trans. Networking, vol. 6, pp. 768-778, Dec. 1998.
11. N. Megiddo, "Combinatorial optimization with rational objective functions," Math. of Oper. Res., vol. 4, no. 4, Nov. 1979.
12. T. Radzik, Fractional combinatorial optimization, in handbook of combinatorial optimization, Editors DingZhu Du and Panos Pardalos, vol. 1, Kluwer Academic Publishes, Dec. 1998.
13. K. Thulasiraman and M. N. Swamy, Graphs: Theory and Algorithms, Willey Interscience, New York, 1992
14. M. Waxman, "Routing of multipoint connections," IEEE J. Selected Areas in Comm. 6(9), Dec. 1988.
15. D. Karger, R. Motwani and G. D. S. Ramkumar, "On approximating the longest path in a graph", Algorithmica 18, pp. 82-98, 1997.
16. A. Orda and A. Sprintson, "Efficient algorithms for computing disjoint QoS paths," IEEE INFOCOM, 2004.
17. J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984.
18. C.-L. Li, S. T. McCormick, and D. Simchi-Levi, "The complexity of finding two disjoint paths with min-max objective function," Discrete Applied Math. 26, 1990, pp. 105-115.
19. Y. Perl and Y. Shiloach, "Finding two disjoint paths between two pairs of vertices in a graph," J. ACM 25, 1978, pp. 105-115.
20. D. Eppstein, "Finding common ancestors and disjoint paths in DAGs," Tech. Report 95-52, Dec. 1995.