Home
Author Guide
Editor Guide
Reviewer Guide
Special Issues
Special Issue Introduction
Special Issues List
Topics
Published Issues
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2010
2009
2008
2007
2006
journal menu
Aims and Scope
Editorial Board
Indexing Service
Article Processing Charge
Open Access Policy
Publication Ethics
Digital Preservation Policy
Editorial Process
Subscription
Contact Us
General Information
ISSN:
1796-2021 (Online); 2374-4367 (Print)
Abbreviated Title:
J. Commun.
Frequency:
Monthly
DOI:
10.12720/jcm
Abstracting/Indexing:
Scopus
;
DBLP
;
CrossRef
,
EBSCO
,
Google Scholar
;
CNKI,
etc.
E-mail questions
or comments to
editor@jocm.us
Acceptance Rate:
27%
APC:
800 USD
Average Days to Accept:
88 days
3.4
2023
CiteScore
51st percentile
Powered by
Article Metrics in Dimensions
Editor-in-Chief
Prof. Maode Ma
College of Engineering, Qatar University, Doha, Qatar
I'm very happy and honored to take on the position of editor-in-chief of JCM, which is a high-quality journal with potential and I'll try my every effort to bring JCM to a next level...
[Read More]
What's New
2024-08-20
Vol. 19, No. 8 has been published online!
2024-07-22
Vol. 19, No. 7 has been published online!
2024-06-20
Volume 19, No. 4 has been indexed by Scopus.
Home
>
Published Issues
>
2020
>
Volume 15, No. 6, June 2020
>
General Multi-constrained QoS Routing Using Nonlinear Function and Weighted Metrics
Maneenate Puongmanee and Teerapat Sanguankotchakorn
Information and Communication Technology Field of Study, School of Engineering and Technology, Asian Institute of Technology, Thailand
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.
3-JCM170539
PREVIOUS PAPER
Data Streams Scheduling Approach for WiMAX Networks
NEXT PAPER
Networked Decentralized Control of Adaptive Structures