Pareto Optimal Based Partition Framework for Two Additive Constrained Path Selection

  • Yanxing Zheng
  • Turgay Korkmaz
  • Wenhua Dou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3420)

Abstract

One of the challenging issues in QoS routing (QoSR) is how to select a multi-constrained path (MCP) that can meet the QoS requirements. We consider the concept of Pareto optimality in the context of MCP problems and establish a Pareto optimal based partition framework (POPF). Based on the key concepts in POPF, we propose algorithm (DA_2CP) to deal with two additive QoS metric.

Keywords

QoS routing Pareto optimal multi-objective optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Zheng, Y., Dou, W., Tian, J., Xiao, M.: An overview of research on qos routing. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol. 2834, pp. 387–397. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Jaffe, J.M.: Algorithms for finding paths with multiple constraints. Networks 14, 95–116 (1984)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Korkmaz, T., Krunz, M., Tragoudas, S.: An efficient algorithm for finding a path subject to two additive constraints. Computer Communications Journal 25, 225–238 (2002)CrossRefGoogle Scholar
  4. 4.
    Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10, 293–310 (1980)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Blokh, D., Gutin, G.: An approximate algorithm for combinatorial optimization problems with two parameters. Australasian Journal of Combinatorics 14, 157–164 (1996)MATHMathSciNetGoogle Scholar
  6. 6.
    Juttner, A., Szviatovszki, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the QoS routing problem. In: Proceedings of the INFOCOM 2001 Conference, vol. 2, pp. 859–868. IEEE, Los Alamitos (2001)Google Scholar
  7. 7.
    Cui, Y., Xu, K., Wu, J.: Precomputation for multi-constrained qos routing in highspeed networks. In: Proceedings of the INFOCOM 2003 Conference, San Francisco (2003)Google Scholar
  8. 8.
    Zheng, Y., Korkmaz, T., Dou, W.: Pareto optimal based partition framework for two additive constrained path selection. Technical report (2004), http://www.cs.utsa.edu/korkmaz/yanxing/POPF.pdf
  9. 9.
    Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: Proceedings of the INFOCOM 2001 Conference, Anchorage, Alaska, vol. 2, pp. 834–843. IEEE, Los Alamitos (2001)Google Scholar
  10. 10.
    Korkmaz, T., Krunz, M.: Routing multimedia traffic with QoS guarantees. IEEE Transactions on Multimedia 5, 429–443 (2003)CrossRefGoogle Scholar
  11. 11.
    Zheng, Y., Tian, J., Liu, Z., Dou, W.: An efficient dynamic weight coefficient qos routing algorithm. In: International Network Conference (INC 2004), UK (2004)Google Scholar
  12. 12.
    Waxman, B.: Performance evaluation of multipoint routing algorithms. In: Proceedings of the INFOCOM 1993 Conference, vol. 3, pp. 980–986. IEEE, Los Alamitos (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yanxing Zheng
    • 1
  • Turgay Korkmaz
    • 2
  • Wenhua Dou
    • 1
  1. 1.School of Computer ScienceNational University of Defense TechnologyP.R. China
  2. 2.Department of Computer ScienceUniversity of TexasSan AntonioUSA

Personalised recommendations