A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph

Service selection problem refers to the selection of appropriate Web services from a large number of candidates in order to create complex composite services that can satisfy users’ quality-of-service (QoS) requirements. However, the existing services selection methods seldom consider the...

Full description

Bibliographic Details
Main Authors: Hong Yu, Qingfeng Zhou, Man Liu
Format: Article
Language:English
Published: Atlantis Press 2014-08-01
Series:International Journal of Computational Intelligence Systems
Subjects:
Online Access:https://www.atlantis-press.com/article/25868515.pdf
id doaj-29899fea59e142be932bced0a8f74338
record_format Article
spelling doaj-29899fea59e142be932bced0a8f743382020-11-25T02:39:05ZengAtlantis PressInternational Journal of Computational Intelligence Systems 1875-68832014-08-017410.1080/18756891.2014.960226A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR GraphHong YuQingfeng ZhouMan LiuService selection problem refers to the selection of appropriate Web services from a large number of candidates in order to create complex composite services that can satisfy users’ quality-of-service (QoS) requirements. However, the existing services selection methods seldom consider the parallel relations between services as well as the dynamic changing of QoS. To combat these defects, a QoS-aware composite services selection model is presented based on an AND/OR graph model in this paper. The weight of edges is defined by considering QoS attributes, and one shorter path in the model is corresponding to the better service composition that satisfies the service request. Besides, the model is not only capable of dealing with sequence relations and fork relations between services, but also capable of dealing with parallel relations between services. And then a heuristic services selection algorithm is developed based on the framework of the ant colony optimization (ACO) to guide finding the path, and which is able to deal with three cases of the dynamic changing of QoS discussed in this paper. The results of comparison experiments show that the proposed method is effective and efficient.https://www.atlantis-press.com/article/25868515.pdfWeb ServicesQuality of ServiceAND/OR GraphDynamic Selection MethodAnt Colony Optimization
collection DOAJ
language English
format Article
sources DOAJ
author Hong Yu
Qingfeng Zhou
Man Liu
spellingShingle Hong Yu
Qingfeng Zhou
Man Liu
A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph
International Journal of Computational Intelligence Systems
Web Services
Quality of Service
AND/OR Graph
Dynamic Selection Method
Ant Colony Optimization
author_facet Hong Yu
Qingfeng Zhou
Man Liu
author_sort Hong Yu
title A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph
title_short A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph
title_full A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph
title_fullStr A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph
title_full_unstemmed A Dynamic Composite Web Services Selection Method With QoS-Aware Based on AND/OR Graph
title_sort dynamic composite web services selection method with qos-aware based on and/or graph
publisher Atlantis Press
series International Journal of Computational Intelligence Systems
issn 1875-6883
publishDate 2014-08-01
description Service selection problem refers to the selection of appropriate Web services from a large number of candidates in order to create complex composite services that can satisfy users’ quality-of-service (QoS) requirements. However, the existing services selection methods seldom consider the parallel relations between services as well as the dynamic changing of QoS. To combat these defects, a QoS-aware composite services selection model is presented based on an AND/OR graph model in this paper. The weight of edges is defined by considering QoS attributes, and one shorter path in the model is corresponding to the better service composition that satisfies the service request. Besides, the model is not only capable of dealing with sequence relations and fork relations between services, but also capable of dealing with parallel relations between services. And then a heuristic services selection algorithm is developed based on the framework of the ant colony optimization (ACO) to guide finding the path, and which is able to deal with three cases of the dynamic changing of QoS discussed in this paper. The results of comparison experiments show that the proposed method is effective and efficient.
topic Web Services
Quality of Service
AND/OR Graph
Dynamic Selection Method
Ant Colony Optimization
url https://www.atlantis-press.com/article/25868515.pdf
work_keys_str_mv AT hongyu adynamiccompositewebservicesselectionmethodwithqosawarebasedonandorgraph
AT qingfengzhou adynamiccompositewebservicesselectionmethodwithqosawarebasedonandorgraph
AT manliu adynamiccompositewebservicesselectionmethodwithqosawarebasedonandorgraph
AT hongyu dynamiccompositewebservicesselectionmethodwithqosawarebasedonandorgraph
AT qingfengzhou dynamiccompositewebservicesselectionmethodwithqosawarebasedonandorgraph
AT manliu dynamiccompositewebservicesselectionmethodwithqosawarebasedonandorgraph
_version_ 1724787734109749248