A Method of Web Service Composition Based on Bipartite Graph Optimal Matching and QoS

Author

Jiang Cui-Qing ; Du Wei ; Yi Cheng-Cheng

Author_Institution

Dept. of Manage., Hefei Univ. of Technol., Hefei, China

fYear

2010

fDate

20-22 Aug. 2010

Firstpage

1

Lastpage

5

Abstract

Considering service semantic association degree, service quality and service composition efficiency, we used bipartite graph optimal matching algorithm to calculate the degree of semantic association and gave QoS (Quality of Service) model. On this basis, we proposed a Web service automatic composition algorithm AL-CWS and proved its validity. The test simulation proved that AL-CWS can automatically realize Web service composition according to service request, and can assure the quality and efficiency of service composition by controlling threshold value. We designed and implemented the prototype system to demonstrate the feasibility of the service composition method proposed in this paper.

Keywords

Web services; graph theory; pattern matching; quality of service; AL-CWS; QoS; Web service automatic composition algorithm; bipartite graph optimal matching algorithm; quality of service model; service composition efficiency; service quality; service semantic association degree; test simulation; Algorithm design and analysis; Bipartite graph; Optimal matching; Quality of service; Semantics; Web services; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Technology and Applications, 2010 International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5142-5

Electronic_ISBN

978-1-4244-5143-2

Type

conf

DOI

10.1109/ITAPP.2010.5566106

Filename

5566106