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 条
  • [1] RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
    Ahmadianfar, Iman
    Heidari, Ali Asghar
    Gandomi, Amir H.
    Chu, Xuefeng
    Chen, Huiling
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 181
  • [2] Efficient Algorithms for Cache-Throughput Analysis in Cellular-D2D 5G Networks
    Anjum, Nasreen
    Yang, Zhaohui
    Khan, Imran
    Kiran, Mahreen
    Wu, Falin
    Rabie, Khaled
    Bahaei, Shikh Muhammad
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2021, 67 (02): : 1759 - 1780
  • [3] Barakat L., 2012, Proceedings of the 2012 IEEE 19th International Conference on Web Services (ICWS), P1, DOI 10.1109/ICWS.2012.62
  • [4] An improved FPTAS for Restricted Shortest Path
    Ergun, F
    Sinha, R
    Zhang, L
    [J]. INFORMATION PROCESSING LETTERS, 2002, 83 (05) : 287 - 291
  • [5] Gao H., 2021, IEEE T INTELL TRANSP, P1, DOI [10.5194/hess-2021-264, DOI 10.1109/TITS.2021.3129458]
  • [6] TSMAE: A Novel Anomaly Detection Approach for Internet of Things Time Series Data Using Memory-Augmented Autoencoder
    Gao, Honghao
    Qiu, Binyang
    Barroso, Ramon J. Duran
    Hussain, Walayat
    Xu, Yueshen
    Wang, Xinheng
    [J]. IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2023, 10 (05): : 2978 - 2990
  • [7] The Cloud-edge-based Dynamic Reconfiguration to Service Workflow for Mobile Ecommerce Environments: A QoS Prediction Perspective
    Gao, Honghao
    Huang, Wanqiu
    Duan, Yucong
    [J]. ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 2021, 21 (01)
  • [8] Understanding the Uncertainty in 1D Unidirectional Moving Target Selection
    Huang, Jin
    Tian, Feng
    Fan, Xiangmin
    Zhang, Xiaolong
    Zhai, Shumin
    [J]. PROCEEDINGS OF THE 2018 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS (CHI 2018), 2018,
  • [9] Leigang Dong, 2017, Computer Engineering, V43, P195, DOI 10.3969/j.issn.1000-3428.2017.06.031
  • [10] Li CL., 2012, LIBR INF, V4, P1