Abstract—Quality of Service (QoS) is an essential mechanism to provide and manage restricted resources for various services and demands. Additionally, it is a crucial factor to guarantee application’s requirements in computer communication and network. Generally, each application needs more than one QoS metric with different significance levels. Thus, the path satisfying all QoS metrics simultaneously with the same significance level is somewhat not realistic and too complicated. This research proposes the algorithm to optimally assign the appropriate weight to each QoS metric by using requirements and slackness to search for the best path satisfying multiconstrained QoS metrics. The proposed algorithm is called General Multi-constrained QoS routing using Weighted Metrics (G_MQW), which adopts the nonlinear cost function and relaxed Dijkstra's algorithm. The general mathematical closedform is derived and the Look-ahead Dijkstra's algorithm is relaxed to accommodate the weighted QoS metrics. Additionally, we propose two control variables of the weight and verify their effects in finding the shortest path satisfying multi-constrained QoS. We evaluate the algorithm by simulation using Matlab on Waxman network topology. The performance evaluation metrics used here are Success Ratio (SR) and Computational Complexity. The results are compared with MPLMR, TAMCRA, H_MCOP, MPMP and BMCOP. It is shown that our proposed G_MQW provides the highest Success Ratio under the same environments as the other ones, while the computational complexity is comparable.

 

Index Terms—Control variables, look-ahead, nonlinear, multiconstrained

Cite: Maneenate Puongmanee and Teerapat Sanguankotchakorn, "General Multi-constrained QoS Routing Using Nonlinear Function and Weighted Metrics," Journal of Communications vol. 15, no. 6, pp. 480-495, June 2020. Doi: 10.12720/jcm.15.6.480-495

Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.