A Web Service Composition Algorithm Based on Graph Search and Semantic Web

Article Preview

Abstract:

With the Development of web service technology, a single web service cannot fulfill different users’ diverse requirements. Adding semantic information to the input-output message of web services provides us a method to implement web service composition automatically. After researching on existing algorithms for web service composition, this article proposed a QoS-oriented web service composition algorithm based on graph search with semantic information.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1637-1640

Citation:

Online since:

November 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Das, Choudhury Bandana, and Prachet Bhuyan. A Systematic Survey report on Various Frameworks and Models for Verification of Choreography in SOA. International Journal of Computer Science Engineering and Technology (IJCSET), Vol. 5, 2014: 441-448.

Google Scholar

[2] Jinghai Rao, Xiaomeng Su. A Survey of Automated Web Service Composition Methods. In Proceedings of First International Workshop on Semantic Web Services and Web Process Composition, 2005: 43-54.

DOI: 10.1007/978-3-540-30581-1_5

Google Scholar

[3] Chishti I, Ma J, Knight B. Ontology Mapping of Business Process Modeling Based on Formal Temporal Logic. International Journal of Advanced Computer Science & Applications, 2014, 5(7).

DOI: 10.14569/ijacsa.2014.050715

Google Scholar

[4] Chaowang Shang, Qingtang Liu, Chengling Zhao, Mingwen Tong. Dynamic Access Control Model of Combinating Web Services Business Process based on Activities Authorized. Computer Applications and Software, 2014, 5(5).

Google Scholar

[5] Xu K, Ma B. A Petri Net Based Execution Engine for Web Service Composition. Web Information Systems Engineering–WISE 2013 Workshops. Springer Berlin Heidelberg, 2014: 181-193.

DOI: 10.1007/978-3-642-54370-8_16

Google Scholar

[6] Du Y, Tan W, Zhou M C. Timed compatibility analysis of web service composition: A modular approach based on Petri nets. Automation Science and Engineering, IEEE Transactions on, 2014, 11(2): 594-606.

DOI: 10.1109/tase.2013.2253552

Google Scholar

[7] Oh S C, On B W, Larson E J, et al. BF*: Web services discovery and composition as graph search problem. e-Technology, e-Commerce and e-Service, 2005: 784-786.

DOI: 10.1109/eee.2005.41

Google Scholar

[8] Liang Q A, Su S Y W. AND/OR graph and search algorithm for discovering composite web services. International Journal of Web Services Research (IJWSR), 2005, 2(4): 48-67.

DOI: 10.4018/jwsr.2005100103

Google Scholar

[9] Hashemian S V, Mavaddat F. A graph-based approach to web services composition. Applications and the Internet, 2005: 183-189.

DOI: 10.1109/saint.2005.4

Google Scholar

[10] Wang P, Ding Z, Jiang C, et al. Automated web service composition supporting conditional branch structures. Enterprise Information Systems, 2014, 8(1): 121-146.

DOI: 10.1080/17517575.2011.584132

Google Scholar