An efficient multiple-constraints qos routing algorithm based on nonlinear path distance

  • Authors:
  • Xiaolong Yang;Min Zhang;Keping Long

  • Affiliations:
  • Chongqing Univ. of Posts and Telecommunications, Chongqing, China;Chongqing Univ. of Posts and Telecommunications, Chongqing, China;Chongqing Univ. of Posts and Telecommunications, Chongqing, China

  • Venue:
  • CIS'04 Proceedings of the First international conference on Computational and Information Science
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a QoS routing algorithm (called MIS-LB), which extends the definition of nonlinear path distances into the link-sharing and load balancing. Based on the extension, it can find feasible paths by the shortest-first criterion, but also adjust the link-sharing and the loads among multiple feasible paths. Finally, the simulation results show that it outperforms other multiple-constraints routing, such as TAMCRA and H_MCOP.