Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Abstract

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration, an algorithm QCDSS (QoS constraints of dynamic Web services selection) to resolve dynamic Web services selection with QoS global optimal path, was proposed. The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints. The operations of the cross and mutation in genetic algorithm were brought into PSOA (particle swarm optimization algorithm), forming an improved algorithm (IPSOA) to solve the QoS global optimal problem. Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

Keywords

Web services composition / optimal service selection / improved particle swarm optimization algorithm (IPSOA) / cross-enterprises collaboration

References

[1] PapazoglouM. P., GeorgakopoulosD.. Service-oriented computing [J]. Communications of the ACM, 2003, 6(10): 25-65

[2] DaniloA., BarbaraP.. Adaptive service composition in flexible processes [J]. IEEE Transactions on Software Engineering, 2007, 33(6): 369-384

[3] WangY., HuC.-m., DuZ.-xia.. QoS-aware grid workflow schedule [J]. Journal of Software, 2006, 17(11): 2341-2351

[4] LiuS.-l., LiuY.-x., ZhangF.. A dynamic Web services selection algorithm with QoS global optimal in Web services composition [J]. Journal of Software, 2007, 18(3): 646-656

[5] GrafenP., AbererK., HoffnerY., LudwigH.. Cross-low: Cross-organizational workflow management in dynamic virtual enterprises [J]. International Journal of Computer Systems Science and Engineering, 2000, 15(5): 277-290

[6] WangP.-w., JinZ., LiuL., CaiG.-jun.. Building toward capability specifications for Web services based on an environment ontology [J]. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(4): 547-561

[7] LiuY. T., AnneH. H., ZengL. Z.. QoS computation and policing in dynamic Web service selection [C]. Proceedings of the www 2004, 2004, New York, ACM Press: 66-73

[8] JorgeC., AmitS., JohnM.. Quality of service for workflows and Web service processes [J]. Journal of Web Semantics, 2004, 1(3): 281-308

[9] ZengL. Z., BoualemB., AnneH. H., JayantK., HenryC.. QoS-aware middle ware for Web Services composition [J]. IEEE Transactions on Software Engineering, 2004, 30(5): 311-327

[10] HuC.-h., WuM., LiuG.-ping.. QoS scheduling based on trust relationship in web service workflow [J]. Chinese Journal of Computer, 2009, 32(1): 42-53

[11] HuC.-h., WuM., LiuG.-p., XuD.-zhi.. An approach to constructing service workflow model based on business spanning graph [J]. Journal of Software, 2007, 18(8): 1870-1882

[12] HuC.-h., WuM., LiuG.-ping.. QoS scheduling algorithm based on hybrid particle swarm optimization strategy for grid workflow [C]. Proceedings of the 6th International Conference on Grid and Cooperative Computing, 2007, New York, IEEE Computer Society: 330-337

[13] EberhartR. C., KennedyJ. A.. A new optimizer using particles swarm theory [C]. Proceedings of the 6th International Symposium on Micro Machine and Human Science, 1995, Nagoya, IEEE: 39-43

[14] EberhartR. C., ShiY.. Particle swarm optimization: Developments applications and resources [C]. Proceedings of IEEE International Conference on Volutionary, 2002, New York, IEEE Computer Society

[15] HuC.-h., WuM., XieQ., WangJ.-ming.. SWES: Performance evaluation system for Web service workflow on QoS [J]. Journal of Central South University: Science and Technology, 2007, 38(5): 962-969