QoS correlation-based service composition algorithm for multi-constraint optimal path selection

被引:1
作者
Yu, Jian [1 ,2 ]
Lin, Zhixing [1 ,2 ]
Yu, Qiong [3 ]
Xiao, Xiangmei [1 ,2 ]
机构
[1] Network Ctr Sanming Univ, Sanming 365004, Fujian, Peoples R China
[2] Sanming Univ, Sch Informat Engn, Sanming 365004, Peoples R China
[3] Sanming 2 High Sch, Sanming 365000, Fujian, Peoples R China
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2023年 / 26卷 / 06期
关键词
Multi-constraint; Optimal path; QoS; Correlation; Service composition;
D O I
10.1007/s10586-022-03791-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As network services tend to be integrated to provide a better quality of service (QoS) to customers, correlations appear to be useful measurements to better design service compositions of an integrated network. However, as the integration intensifies, the determination of the service compositions of the network requires the ease of computational issues in this dynamic environment, which are resolved by the cloud computing platforms. The manuscript proposes an algorithm based on multi-constraint optimal path selection (MCOPS) that benefits from available notions such as QoS correlation criteria and correlation ratios, and skyline algorithm to construct a novel directed cyclic graph whose calculations are conducted on the cloud platform dynamically. Both cost and delay attributes in the construction of network service compositions for customers are included in the graph. Simulations suggest that both average calculation time and the quality of the path solution are substantially enhanced with the utilization of cloud computing in network service compositions. Consequently, a better service composition plan (SCP) is attained when a correlated structure is assumed to exist.
引用
收藏
页码:3823 / 3837
页数:15
相关论文
共 33 条
  • [21] Monarch butterfly optimization
    Wang, Gai-Ge
    Deb, Suash
    Cui, Zhihua
    [J]. NEURAL COMPUTING & APPLICATIONS, 2019, 31 (07) : 1995 - 2014
  • [22] Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems
    Wang, Gai-Ge
    Deb, Suash
    Coelho, Leandro dos Santos
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2018, 12 (01) : 1 - 22
  • [23] Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems
    Wang, Gai-Ge
    [J]. MEMETIC COMPUTING, 2018, 10 (02) : 151 - 164
  • [24] Xiong L., 2013, THESIS NANJING U POS
  • [25] [熊小兵 Xiong Xiaobing], 2018, [小型微型计算机系统, Journal of Chinese Computer Systems], V39, P1565
  • [26] Polynomial time approximation algorithms for multi-constrained QoS routing
    Xue, Guoliang
    Zhang, Weiyi
    Tang, Jian
    Thulasiraman, Krishnaiyan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (03) : 656 - 669
  • [27] Yang K., 2019, TELECOMMUN SCI, V35, P176
  • [28] Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts
    Yang, Yutao
    Chen, Huiling
    Heidari, Ali Asghar
    Gandomi, Amir H.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 177
  • [29] Yao J.Y., 2009, P ELECT IND, P158
  • [30] Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints
    Yu, Tao
    Zhang, Yue
    Lin, Kwei-Jay
    [J]. ACM TRANSACTIONS ON THE WEB, 2007, 1 (01)