FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling
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....
Gespeichert in:
Veröffentlicht in: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2016/04/01, Vol.E99.A(4), pp.826-834 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 834 |
---|---|
container_issue | 4 |
container_start_page | 826 |
container_title | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
container_volume | E99.A |
creator | LU, Wei WANG, Weidong BAO, Ergude WANG, Liqiang XING, Weiwei CHEN, Yue |
description | 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. |
doi_str_mv | 10.1587/transfun.E99.A.826 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1808109914</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808109914</sourcerecordid><originalsourceid>FETCH-LOGICAL-c512t-266fd7ddc6a97bcb5c95bf06e051bd413fa32600fabb43566662517a66a0a5373</originalsourceid><addsrcrecordid>eNpdkEFLwzAUgIMoOKd_wFOPXlqTpklbb3VsThjIqOIxvKbpltE2NckU_72V6QTf5cHj-97hQ-ia4IiwLL31FnrX7PtonudREWUxP0ETkiYsJJSmp2iCc8LDjOHsHF04t8OYZDFJJmi5KNblXbAA54NXVQWlsu9aqmBmusE47bXpg6LdGKv9tgvuwak6GE9rU4bFB1gVlNANre43l-isgdapq589RS-L-fNsGa6eHh5nxSqUjMQ-jDlv6rSuJYc8rWTFZM6qBnOFGanqhNAGaMwxbqCqEsr4ODEjKXAOGBhN6RTdHP4O1rztlfOi006qtoVemb0TJMMZwXlOkhGND6i0xjmrGjFY3YH9FASL72ziN5sYs4lCjNlGaXmQds7DRh0VsF7LVv1Xkj_1iMgtWKF6-gXHUXyO</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1808109914</pqid></control><display><type>article</type><title>FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling</title><source>J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese</source><creator>LU, Wei ; WANG, Weidong ; BAO, Ergude ; WANG, Liqiang ; XING, Weiwei ; CHEN, Yue</creator><creatorcontrib>LU, Wei ; WANG, Weidong ; BAO, Ergude ; WANG, Liqiang ; XING, Weiwei ; CHEN, Yue</creatorcontrib><description>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.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.E99.A.826</identifier><language>eng</language><publisher>The Institute of Electronics, Information and Communication Engineers</publisher><subject>Algorithms ; Composing ; Knapsack problem ; Mathematical analysis ; Meetings ; near-optimal composition ; quality of service ; sampled services ; Sampling ; Tasks ; web service composition ; Web services</subject><ispartof>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016/04/01, Vol.E99.A(4), pp.826-834</ispartof><rights>2016 The Institute of Electronics, Information and Communication Engineers</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c512t-266fd7ddc6a97bcb5c95bf06e051bd413fa32600fabb43566662517a66a0a5373</citedby><cites>FETCH-LOGICAL-c512t-266fd7ddc6a97bcb5c95bf06e051bd413fa32600fabb43566662517a66a0a5373</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>LU, Wei</creatorcontrib><creatorcontrib>WANG, Weidong</creatorcontrib><creatorcontrib>BAO, Ergude</creatorcontrib><creatorcontrib>WANG, Liqiang</creatorcontrib><creatorcontrib>XING, Weiwei</creatorcontrib><creatorcontrib>CHEN, Yue</creatorcontrib><title>FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling</title><title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</title><addtitle>IEICE Trans. Fundamentals</addtitle><description>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.</description><subject>Algorithms</subject><subject>Composing</subject><subject>Knapsack problem</subject><subject>Mathematical analysis</subject><subject>Meetings</subject><subject>near-optimal composition</subject><subject>quality of service</subject><subject>sampled services</subject><subject>Sampling</subject><subject>Tasks</subject><subject>web service composition</subject><subject>Web services</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNpdkEFLwzAUgIMoOKd_wFOPXlqTpklbb3VsThjIqOIxvKbpltE2NckU_72V6QTf5cHj-97hQ-ia4IiwLL31FnrX7PtonudREWUxP0ETkiYsJJSmp2iCc8LDjOHsHF04t8OYZDFJJmi5KNblXbAA54NXVQWlsu9aqmBmusE47bXpg6LdGKv9tgvuwak6GE9rU4bFB1gVlNANre43l-isgdapq589RS-L-fNsGa6eHh5nxSqUjMQ-jDlv6rSuJYc8rWTFZM6qBnOFGanqhNAGaMwxbqCqEsr4ODEjKXAOGBhN6RTdHP4O1rztlfOi006qtoVemb0TJMMZwXlOkhGND6i0xjmrGjFY3YH9FASL72ziN5sYs4lCjNlGaXmQds7DRh0VsF7LVv1Xkj_1iMgtWKF6-gXHUXyO</recordid><startdate>2016</startdate><enddate>2016</enddate><creator>LU, Wei</creator><creator>WANG, Weidong</creator><creator>BAO, Ergude</creator><creator>WANG, Liqiang</creator><creator>XING, Weiwei</creator><creator>CHEN, Yue</creator><general>The Institute of Electronics, Information and Communication Engineers</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2016</creationdate><title>FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling</title><author>LU, Wei ; WANG, Weidong ; BAO, Ergude ; WANG, Liqiang ; XING, Weiwei ; CHEN, Yue</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c512t-266fd7ddc6a97bcb5c95bf06e051bd413fa32600fabb43566662517a66a0a5373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Composing</topic><topic>Knapsack problem</topic><topic>Mathematical analysis</topic><topic>Meetings</topic><topic>near-optimal composition</topic><topic>quality of service</topic><topic>sampled services</topic><topic>Sampling</topic><topic>Tasks</topic><topic>web service composition</topic><topic>Web services</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>LU, Wei</creatorcontrib><creatorcontrib>WANG, Weidong</creatorcontrib><creatorcontrib>BAO, Ergude</creatorcontrib><creatorcontrib>WANG, Liqiang</creatorcontrib><creatorcontrib>XING, Weiwei</creatorcontrib><creatorcontrib>CHEN, Yue</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>LU, Wei</au><au>WANG, Weidong</au><au>BAO, Ergude</au><au>WANG, Liqiang</au><au>XING, Weiwei</au><au>CHEN, Yue</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling</atitle><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle><addtitle>IEICE Trans. Fundamentals</addtitle><date>2016</date><risdate>2016</risdate><volume>E99.A</volume><issue>4</issue><spage>826</spage><epage>834</epage><pages>826-834</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><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.</abstract><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transfun.E99.A.826</doi><tpages>9</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0916-8508 |
ispartof | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016/04/01, Vol.E99.A(4), pp.826-834 |
issn | 0916-8508 1745-1337 |
language | eng |
recordid | cdi_proquest_miscellaneous_1808109914 |
source | J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese |
subjects | Algorithms Composing Knapsack problem Mathematical analysis Meetings near-optimal composition quality of service sampled services Sampling Tasks web service composition Web services |
title | FAQS: Fast Web Service Composition Algorithm Based on QoS-Aware Sampling |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T18%3A27%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=FAQS:%20Fast%20Web%20Service%20Composition%20Algorithm%20Based%20on%20QoS-Aware%20Sampling&rft.jtitle=IEICE%20Transactions%20on%20Fundamentals%20of%20Electronics,%20Communications%20and%20Computer%20Sciences&rft.au=LU,%20Wei&rft.date=2016&rft.volume=E99.A&rft.issue=4&rft.spage=826&rft.epage=834&rft.pages=826-834&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.E99.A.826&rft_dat=%3Cproquest_cross%3E1808109914%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1808109914&rft_id=info:pmid/&rfr_iscdi=true |