AN OPTIMAL ALGORITHM ON MULTIPLE CONSTRAINED QOS ROUTING

Multiple constrained QoS routing optimization is an important problem in the current communication network research. A kind of source destination QoS routing problem is addressed. By analysis and without losing generality, delay and loss rate are chosen as QoS parameters and a nonlinear integer programming of QoS routing with minimal delay subjected to loss rate constraint is established. According to the characteristic of the model, an algorithm based on linear integer programming to obtain a precise solution is presented. The algorithm can be extended to cases of multiple QoS parameters conveniently. Finally, an example demonstrates that the model and the algorithm are effective and efficient.