Effective Pruning Algorithm for QoS-Aware Service Composition

Author

Huang, Zhenqiu ; Jiang, Wei ; Hu, Songlin ; Liu, Zhiyong

Author_Institution

Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing, China

fYear

2009

fDate

20-23 July 2009

Firstpage

519

Lastpage

522

Abstract

Automatic service composition has been a hot topic in both academia and industry. It begins with syntactic composition, and then evolves semantic description. QoS of the composition comes into researcherspsila mind, which aims at meeting the need of the overall qualities like service fee, response time, throughput, etc. In this paper, a novel QoS-aware approach is presented. It adopts a forward filtering algorithm to reduce the number of service candidates, along with a modified dynamic programming approach to compute optimal values. Finally, a backward search is utilized to find out the optimal composition results efficiently.

Keywords

Web services; dynamic programming; quality of service; Web service; automatic service composition; backward search; forward filtering algorithm; modified dynamic programming approach; pruning algorithm; quality of service; semantic description; syntactic composition; Artificial intelligence; Business; Computer industry; Delay; Dynamic programming; Filtering algorithms; Matched filters; Process planning; Throughput; Yarn; QoS; dynamic programming; pruning; service composition;

fLanguage

English

Publisher

ieee

Conference_Titel

Commerce and Enterprise Computing, 2009. CEC '09. IEEE Conference on

Conference_Location

Vienna

Print_ISBN

978-0-7695-3755-9

Type

conf

DOI

10.1109/CEC.2009.41

Filename

5210745