Advertisement

Multi-constrained Least Cost QoS Routing Algorithm

  • H. Jiang
  • P. -l. Yan
  • J. -g. Zhou
  • L. -j. Chen
  • M. Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3124)

Abstract

To obtain multi-constrained QoS path with minimal cost, a least-cost QoS routing algorithm–LBPSA (Lagrangian Branch-and-bound path selection algorithm) is presented. This algorithm uses Lagrangian relaxation to obtain the lower bound and the upper bound of the least cost of multi-constrained QoS path. And finds the multi-constrained QoS path with least cost by branch-and-bound method. In solving the Lagrangian multiplier problem, it introduced a new iteration method. Through recursion from destination to source based on branch-and-bound scheme, the least-cost multi-constrained path is obtained. The proposed algorithm has a pseudopolynomial running time. The simulation shows that the algorithm can find the path with high success ratio and low complexity. To the topology in reality, the success ratio of the algorithm is very high.

Keywords

Minimum Span Tree Lagrangian Relaxation Success Ratio Iteration Time Feasible Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Crawley, E., Nair, R., Rajagopalan, B., et al.: A framework for QoS-based routing in the Internet. RFC 2386 (1998)Google Scholar
  2. 2.
    Wang, Z., Crowcroft, J.: QoS routing for supporting resource reservation. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)CrossRefGoogle Scholar
  3. 3.
    Ma, Q., Steenkiste, P.: Quality-of-Service routing with performance guarantees. In: Proceedings of the 4th International IFIP Workshop on Quality of Service, IFIP WG6.1, New York (1997)Google Scholar
  4. 4.
    Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)CrossRefGoogle Scholar
  5. 5.
    Juttner, A., Szviatovski, M.B.I., et al.: Lagrange relaxation based method for the QoS routing problem. In: Proceedings of the IEEE INFOCOM 2001, pp. 859–868. IEEE Communication Society (2001)Google Scholar
  6. 6.
    Ahuja, K., Magnanti, L.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)Google Scholar
  7. 7.
    Thomas, H., Cormen Charles, E., Leiserson Ronald, L., et al.: Introduction to Algorithms. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  8. 8.
    Korkmaz, T., Krunz, M.: Multi-Constrained Optimal Path Selection. In: Proceedings of IEEE INFOCOM, pp. 834–843 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • H. Jiang
    • 1
  • P. -l. Yan
    • 1
  • J. -g. Zhou
    • 1
  • L. -j. Chen
    • 1
  • M. Wu
    • 1
  1. 1.School of Electronic InformationWuhan UniversityWuhanChina

Personalised recommendations