Adaptive Service Selection According to the Service Density in Multiple Qos Aspects

被引:21
|
作者
Cho, Jae-Hyun [1 ]
Ko, Han-Gyu [1 ]
Ko, In-Young [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Sch Comp, Daejeon, South Korea
关键词
Quality of service (QoS); service composition; QoS optimization; adaptive service selection; INTERNET;
D O I
10.1109/TSC.2015.2428251
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In task-oriented service computing, a user's computing goal is modeled and represented as a task, which is composed of activities that are performed by accessing service instances in a local environment. The abstract service requirements specified in an activity of a task are resolved and bound to service instances dynamically in runtime. When there are many candidate services that provide similar capabilities for a task, it is essential to consider quality of service (QoS) such as response time, latency, and availability to determine which service instances to use. Finding a service composition that meets the optimal level of quality is a well-known NP-hard problem-the time complexity for task-level (global) optimization increases exponentially as the number of services and the number of quality attributes increase. Although it is possible to use a heuristic approach that shows a reasonable response time with a certain level of service quality, this strategy often fails when there are hard QoS constraints that need to be considered in the task level. In this paper, to overcome this limitation, we propose an adaptive method of selecting services based on the hardness of QoS constraints. The basic idea is to sample services that represent a specific quality-value range. The quality-value range of candidate services is divided into smaller sub-ranges in which representative services are sampled and evaluated. At this time, the size of the QoS sub-ranges is determined adaptably based on the hardness of the QoS constraints. In a QoS sub-range, candidate services may have a similar QoS value for a quality attribute. We calculate the utility of candidate services in a QoS sub-range and sample the highest utility service. This process of sampling services and evaluating their utility value is repeated until it makes a composite service that has the highest level of global utility for a task. Our experiment results show that the proposed approach effectively improves the success rate of service composition while achieving a certain level of global optimality and maintaining a reasonable level of performance. Our approach shows up to 80 percent improvement in success rate in comparison to the existing heuristic approaches.
引用
收藏
页码:883 / 894
页数:12
相关论文
共 50 条
  • [1] Efficient adaptive QoS-based service selection
    Barakat, Lina
    Miles, Simon
    Luck, Michael
    SERVICE ORIENTED COMPUTING AND APPLICATIONS, 2014, 8 (04) : 261 - 276
  • [2] QoS-Based Service Selection Method for Big Data Service Composition
    Li, Dong
    Wu, Jiechu
    Deng, Zehang
    Chen, Zelin
    Xu, Yang
    2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE) AND IEEE/IFIP INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC), VOL 1, 2017, : 436 - 443
  • [3] Service Selection for Composition with QoS Correlations
    Deng, Shuiguang
    Wu, Hongyue
    Hu, Daning
    Zhao, J. Leon
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2016, 9 (02) : 291 - 303
  • [4] QoS ontology for service selection and reuse
    Sophea Chhun
    Néjib Moalla
    Yacine Ouzrout
    Journal of Intelligent Manufacturing, 2016, 27 : 187 - 199
  • [5] QoS ontology for service selection and reuse
    Chhun, Sophea
    Moalla, Nejib
    Ouzrout, Yacine
    JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (01) : 187 - 199
  • [6] An adaptive service selection method for cross-cloud service composition
    Yang, Jun
    Lin, Wenmin
    Dou, Wanchun
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2013, 25 (18) : 2435 - 2454
  • [7] Accurate QoS-based Service Selection Algorithm for Service Composition
    Liao, Jianxin
    Liu, Yang
    Zhu, Xiaomin
    Wang, Jingyu
    Qi, Qi
    PROCEEDINGS OF THE 2013 38TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2013), 2013, : 344 - +
  • [8] On Solving QoS-Aware Service Selection Problem with Service Composition
    Wan, Changlin
    Ullrich, Carsten
    Chen, Limin
    Huang, Rui
    Luo, Jiewen
    Shi, Zhongzhi
    GCC 2008: SEVENTH INTERNATIONAL CONFERENCE ON GRID AND COOPERATIVE COMPUTING, PROCEEDINGS, 2008, : 467 - +
  • [9] Service Selection based on Correlated QoS Requirements
    Wang, Yanchun
    He, Qiang
    Ye, Dayong
    Yang, Yun
    2017 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (SCC), 2017, : 241 - 248
  • [10] A relaxable service selection algorithm for QoS-based web service composition
    Lin, Chia-Feng
    Sheu, Ruey-Kai
    Chang, Yue-Shan
    Yuan, Shyan-Ming
    INFORMATION AND SOFTWARE TECHNOLOGY, 2011, 53 (12) : 1370 - 1381