Proceedings Article | 15 April 2004
KEYWORDS: Reliability, Lithium, Computer science, Networks, Optimization (mathematics), Mathematics, Computer programming, Telecommunications, Video, Network architectures
As known, the QoS routing under multiple constraints, which can be additive, multiplicative and concave, is a NP-complete problem, and is difficult to get a polynomial-time solution. Currently, many heuristic algorithms have been proposed to solve this problem, where the path distance usually acts as the most important factor during the routing decision-making. However, most of heuristic algorithms are based on linear path distance, which has the greatest shortcoming, i.e., the search of feasible solutions is inefficient. Besides, they also consider the link sharing interference and load balancing. To improve their performance, this paper proposes a novel QoS routing for multiple constraints based on the nonlinear path distance, which is called MIS-LB. At first, this paper represents the additive and multiplicative QoS metrics in the uniform metric, i.e. the nonlinear path distance. Then, the paper also brings the link sharing and load balancing into the uniform metric. Based on the shortest-first criterion, MIS-LB can not only find feasible paths as the normal routing algorithm (e.g., Dijkstra algorithm), but also adjust the link sharing, and balance the network loads between multiple feasible paths. So compared with TAMCRA and H_MCOP, the simulation results show that MIS-LB can further improve network performance.
