Open Access Open Access  Restricted Access Subscription Access

Parallel Web Service Composition Algorithm Based on Graph

Jingjing Hu,
Guijin Wu,
Xiaolei Chen,
Feifei Peng,
Jingfeng Xue,

Abstract


Web service composition is an important research of service computing. This paper aims to improve the web service dependency graph to raise the accuracy of service selection, and presents a parallel service composition algorithm based on MapReduce to enhance the efficiency of service composition, which addresses the current limitations of inaccuracy and inefficiency in massive service composition. Experimental results show that the strategies can acquire the feasible scheme of web service composition based on QoS and reduce the composition time by 68% on average in large-scale collection of web services to meet users' demands correctly and efficiently.

Keywords


Web service composition; Web service dependency graph; Parallel

Citation Format:
Jingjing Hu, Guijin Wu, Xiaolei Chen, Feifei Peng, Jingfeng Xue, "Parallel Web Service Composition Algorithm Based on Graph," Journal of Internet Technology, vol. 18, no. 3 , pp. 667-676, May. 2017.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.




Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314　　E-mail: jit.editorial@gmail.com