IEICE TRANSACTIONS on Fundamentals
FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling
Summary :
Web Service Composition (WSC) has been well recognized as a convenient and flexible way of service sharing and integration in service-oriented application fields. WSC aims at selecting and composing a set of initial services with respect to the Quality of Service (QoS) values of their attributes (e.g., price), in order to complete a complex task and meet user requirements. A major research challenge of the QoS-aware WSC problem is to select a proper set of services to maximize the QoS of the composite service meeting several QoS constraints upon various attributes, e.g. total price or runtime. In this article, a fast algorithm based on QoS-aware sampling (FAQS) is proposed, which can efficiently find the near-optimal composition result from sampled services. FAQS consists of five steps as follows. 1) QoS normalization is performed to unify different metrics for QoS attributes. 2) The normalized services are sampled and categorized by guaranteeing similar number of services in each class. 3) The frequencies of the sampled services are calculated to guarantee the composed services are the most frequent ones. This process ensures that the sampled services cover as many as possible initial services. 4) The sampled services are composed by solving a linear programming problem. 5) The initial composition results are further optimized by solving a modified multi-choice multi-dimensional knapsack problem (MMKP). Experimental results indicate that FAQS is much faster than existing algorithms and could obtain stable near-optimal result.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.4 pp.826-834
- Publication Date
- 2016/04/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.826
- Type of Manuscript
- PAPER
- Category
- Mathematical Systems Science
Authors
Wei LU
Beijing Jiaotong University
Weidong WANG
Beijing Jiaotong University
Ergude BAO
Beijing Jiaotong University
Liqiang WANG
University of Wyoming
Weiwei XING
Beijing Jiaotong University
Yue CHEN
General Research Institute for Nonferrous Metals
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wei LU, Weidong WANG, Ergude BAO, Liqiang WANG, Weiwei XING, Yue CHEN, "FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 4, pp. 826-834, April 2016, doi: 10.1587/transfun.E99.A.826.
Abstract: Web Service Composition (WSC) has been well recognized as a convenient and flexible way of service sharing and integration in service-oriented application fields. WSC aims at selecting and composing a set of initial services with respect to the Quality of Service (QoS) values of their attributes (e.g., price), in order to complete a complex task and meet user requirements. A major research challenge of the QoS-aware WSC problem is to select a proper set of services to maximize the QoS of the composite service meeting several QoS constraints upon various attributes, e.g. total price or runtime. In this article, a fast algorithm based on QoS-aware sampling (FAQS) is proposed, which can efficiently find the near-optimal composition result from sampled services. FAQS consists of five steps as follows. 1) QoS normalization is performed to unify different metrics for QoS attributes. 2) The normalized services are sampled and categorized by guaranteeing similar number of services in each class. 3) The frequencies of the sampled services are calculated to guarantee the composed services are the most frequent ones. This process ensures that the sampled services cover as many as possible initial services. 4) The sampled services are composed by solving a linear programming problem. 5) The initial composition results are further optimized by solving a modified multi-choice multi-dimensional knapsack problem (MMKP). Experimental results indicate that FAQS is much faster than existing algorithms and could obtain stable near-optimal result.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.826/_p
Copy
@ARTICLE{e99-a_4_826,
author={Wei LU, Weidong WANG, Ergude BAO, Liqiang WANG, Weiwei XING, Yue CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling},
year={2016},
volume={E99-A},
number={4},
pages={826-834},
abstract={Web Service Composition (WSC) has been well recognized as a convenient and flexible way of service sharing and integration in service-oriented application fields. WSC aims at selecting and composing a set of initial services with respect to the Quality of Service (QoS) values of their attributes (e.g., price), in order to complete a complex task and meet user requirements. A major research challenge of the QoS-aware WSC problem is to select a proper set of services to maximize the QoS of the composite service meeting several QoS constraints upon various attributes, e.g. total price or runtime. In this article, a fast algorithm based on QoS-aware sampling (FAQS) is proposed, which can efficiently find the near-optimal composition result from sampled services. FAQS consists of five steps as follows. 1) QoS normalization is performed to unify different metrics for QoS attributes. 2) The normalized services are sampled and categorized by guaranteeing similar number of services in each class. 3) The frequencies of the sampled services are calculated to guarantee the composed services are the most frequent ones. This process ensures that the sampled services cover as many as possible initial services. 4) The sampled services are composed by solving a linear programming problem. 5) The initial composition results are further optimized by solving a modified multi-choice multi-dimensional knapsack problem (MMKP). Experimental results indicate that FAQS is much faster than existing algorithms and could obtain stable near-optimal result.},
keywords={},
doi={10.1587/transfun.E99.A.826},
ISSN={1745-1337},
month={April},}
Copy
TY - JOUR
TI - FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 826
EP - 834
AU - Wei LU
AU - Weidong WANG
AU - Ergude BAO
AU - Liqiang WANG
AU - Weiwei XING
AU - Yue CHEN
PY - 2016
DO - 10.1587/transfun.E99.A.826
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2016
AB - Web Service Composition (WSC) has been well recognized as a convenient and flexible way of service sharing and integration in service-oriented application fields. WSC aims at selecting and composing a set of initial services with respect to the Quality of Service (QoS) values of their attributes (e.g., price), in order to complete a complex task and meet user requirements. A major research challenge of the QoS-aware WSC problem is to select a proper set of services to maximize the QoS of the composite service meeting several QoS constraints upon various attributes, e.g. total price or runtime. In this article, a fast algorithm based on QoS-aware sampling (FAQS) is proposed, which can efficiently find the near-optimal composition result from sampled services. FAQS consists of five steps as follows. 1) QoS normalization is performed to unify different metrics for QoS attributes. 2) The normalized services are sampled and categorized by guaranteeing similar number of services in each class. 3) The frequencies of the sampled services are calculated to guarantee the composed services are the most frequent ones. This process ensures that the sampled services cover as many as possible initial services. 4) The sampled services are composed by solving a linear programming problem. 5) The initial composition results are further optimized by solving a modified multi-choice multi-dimensional knapsack problem (MMKP). Experimental results indicate that FAQS is much faster than existing algorithms and could obtain stable near-optimal result.
ER -
English
