04733nas a2200469 a 4500 20260818115003.0 210126s2020 th uu m rtt 0| a1eng d .b12362207 AIT Diss. no.ICT-20-01 Maneenate Puongmanee General multi-constrained Qos routing using nonlinear function and priority metrics Pathum Thani, Thailand : Asian Institute of Technology, 2020 67 leaves : ill. Dissertation ; no. ICT-20-01 A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information and Communications Technologies, School of Engineering and Technology Thesis (Ph.D.) - Asian Institute of Technology, 2020 As long as the Internet is a communication portal of human and the limitation network of resources are still resolved, Quality of Service (QoS) is an essential measurement to manage data traffic satisfying the categories of demands. Generally, applications and services require different levels of guarantee in demand of service and network resources. Normally, there are more than one QoS metric on each link for instant delay, jitter and loss rate which have correlation to each other. Link correlation, network state and information are dynamically changed when a data traffic is changed. Feasible path selection which satisfies multiple constraints due to different requirements and dynamic changing of the resources is NPcomplete problem. Several feasible paths can be selected as path candidacy with respect to the best path satisfying QoS metric under consideration. Thus, the path satisfying all QoS metrics with the same significant level is somewhat not realistic and too complicated. This research proposes the algorithm to optimally assigning appropriate weight to each QoS metric by using requirements and slackness (remaining resources) to explore the best path satisfying multi-constrained QoS metrics with different link cost correlations. The proposed algorithm is called General Multi-constrained QoS routing using Weighted Metrics (G_MQW), Zhich adoSWV Whe nonlineaU coVW fXncWion and Uela[ed DijkVWUaœV algoUiWhm. The general mathematical closed-form is derived and the Look-ahead DijkVWUaœV algoUiWhm iV relaxed to accommodate the weighted QoS metrics. To enhance probability of feasible path selection, we propose two control variables of the weight and verify their effects in finding the feasible path satisfying multi-constrained QoS. The path selection in this work is based on only the additive QoS metric for unicast communication in network layer. We evaluate the algorithm by simulation using Matlab on Waxman and Barabási network topologies. The evaluation metrics used are Success Ratio (SR), path optimization and computational complexity. The results are compared with MPLMR, TAMCRA, H_MCOP, MPMP, NLR_MCP and Bidirectional Multi-constrained Routing Algorithm. It is shown that our algorithm, G_MQW, produces the highest Success Ratio with less number of hops under the same environments with the other ones, while the computational complexity is comparable. Routers (Computer networks) Computer networks Quality control Nonlinear functional analysis Teerapat Sanguankotchakorn, Chairperson Poompat Saengudomlert, Examination Committee Aimaschana Niruntasukrat, Examination committee Prince of Songkla University, Thailand, Scholarship donor Asian Institute of Technology. Dissertations ; no. ICT-20-01 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B11248 .b12362207 mnait m 240418 0 210126 m a m 0 mnait mnait mnarc mnarc 40 61 20 Barcode : 30050120888325 CREATED : 2021-01-14 RECORD # : i13317398 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : - CREATED : 2021-01-14 RECORD # : i13317404 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050121029218 CREATED : 2022-09-21 RECORD # : i13401270 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050121029200 CREATED : 2022-09-21 RECORD # : i13401294 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 49281 49281 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Diss. no.ICT-20-01 30050120888325 2026-08-18 11:50:03 1 2026-08-18 40 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Diss. no.ICT-20-01 2026-08-18 11:50:03 2026-08-18 61 0 0 0 0 MAIN MAIN mnait 2026-08-18 50.00 0 AIT Diss. no.ICT-20-01 30050121029218 2026-08-18 11:50:03 1 2026-08-18 20 0 0 0 0 MAIN MAIN mnait 2026-08-18 50.00 0 AIT Diss. no.ICT-20-01 30050121029200 2026-08-18 11:50:03 2 2026-08-18 20