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

被引:0
|
作者
Jian Yu
Zhixing Lin
Qiong Yu
Xiangmei Xiao
机构
[1] Network Center of Sanming University,School of Information Engineering
[2] Sanming University,undefined
[3] Sanming No. 2 High School,undefined
来源
Cluster Computing | 2023年 / 26卷
关键词
Multi-constraint; Optimal path; QoS; Correlation; Service composition;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:14
相关论文
共 50 条
  • [31] A hybrid artificial bee colony algorithm for optimal selection of QoS-based cloud manufacturing service composition
    Jiajun Zhou
    Xifan Yao
    [J]. The International Journal of Advanced Manufacturing Technology, 2017, 88 : 3371 - 3387
  • [32] A hybrid artificial bee colony algorithm for optimal selection of QoS-based cloud manufacturing service composition
    Zhou, Jiajun
    Yao, Xifan
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2017, 88 (9-12): : 3371 - 3387
  • [33] Optimal QoS Constraint Service Composition in Mobile Ad Hoc Networks
    Veeresh, P.
    Sam, R. Praveen
    Belgaum, Mohammad Riyaz
    [J]. 2017 4TH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING TECHNOLOGIES AND APPLIED SCIENCES (ICETAS), 2017,
  • [34] An Optimal Service Selection with Constraints Based on QoS
    Qin, Shengjun
    Chen, Yan
    Mu, Xiangwei
    [J]. INTERNATIONAL CONFERENCE ON SOLID STATE DEVICES AND MATERIALS SCIENCE, 2012, 25 : 2050 - 2057
  • [35] Conceptual correlation-based method for grid service composition
    Ni, Wancheng
    Liu, Lianchen
    Wu, Cheng
    Liu, Wei
    [J]. Qinghua Daxue Xuebao/Journal of Tsinghua University, 2007, 47 (10): : 1581 - 1585
  • [36] A new evolving mechanism of genetic algorithm for multi-constraint intelligent camera path planning
    Chen, Zeqiu
    Zhou, Jianghui
    Sun, Ruizhi
    Kang, Li
    [J]. SOFT COMPUTING, 2021, 25 (07) : 5073 - 5092
  • [37] A new evolving mechanism of genetic algorithm for multi-constraint intelligent camera path planning
    Zeqiu Chen
    Jianghui Zhou
    Ruizhi Sun
    Li Kang
    [J]. Soft Computing, 2021, 25 : 5073 - 5092
  • [38] A Web Service Composition Selection Approach based on Multi-Dimension QoS
    Li, Lu
    Rong, Mei
    Zhang, Guangquan
    [J]. PROCEEDINGS OF THE 2013 8TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION (ICCSE 2013), 2013, : 1463 - 1468
  • [39] An algorithm acceleration framework for correlation-based feature selection
    Yan, Xuefeng
    Zhang, Yuqing
    Khan, Arif Ali
    [J]. 2020 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE COMMUNICATION AND NETWORK SECURITY (CSCNS2020), 2021, 336
  • [40] A Reverse Order-Based QoS Constraint Correction Approach for Optimizing Execution Path for Service Composition
    Ren, Kaijun
    Xiao, Nong
    Chen, Jinjun
    Song, Junqiang
    [J]. ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2008 WORKSHOPS, 2008, 5333 : 29 - +