A Min-Conflict Heuristic-Based Web Service Chain Reconfiguration Approach
Haifeng Li, Xiaoxia Yang
DOI: 10.4236/iim.2010.210068   PDF    HTML     4,868 Downloads   8,677 Views   Citations


The state-of-art Web services composition approaches are facing more and more serious bottlenecks of effectiveness and stability with the increasing diversity and real-time requirements of applications, since new web service chain must be generated from “scratch” for each application. To break these bottlenecks, this paper presents a Min-Conflict Heuristic-Based Web Service Chain Reconfiguration Approach(MCHRC) to maximal reuse relative web services chain: a min-conflict heuristic based regression search algorithms is proposed to implement the web services chain reconfiguration based on the formal definition of process constraint and integrity constraint to guarantee the correctness and integrality of the reconfiguration. This benefits the service reuse and then can relieve the time complexity of web service composition and improve web services chain executing stability by reduce service provider load. Experimental results show that this approach makes significant improvement on the effectiveness of web services composition.

Share and Cite:

H. Li and X. Yang, "A Min-Conflict Heuristic-Based Web Service Chain Reconfiguration Approach," Intelligent Information Management, Vol. 2 No. 10, 2010, pp. 597-607. doi: 10.4236/iim.2010.210068.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] X. Tang, C. Jiang and Z. Ding, “Automatic Web Service Composition Based on Logical Inference of Horn Clauses in Petri Net Models,” Proceedings of the 5th IEEE International Conference on Web Services (ICWS 2007), IEEE Computer Society, 2007, pp. 1162-1163.
[2] D. Berardi, D. Calvanese and G. De Giacoma, “Automatic Service Composition Based on Behavioral Descriptions,” International Journal of Cooperative Information Systems, 2005, Vol. 14, No. 4, pp. 333-376.
[3] M. Klusch, A. Gerber and M. Schmidt, “Semantic Web Service Composition Planning with OWLS-Xplan,” Proceedings of 1st International Symposium on Agents and the Semantic Web, 2005, pp. 55-62.
[4] L. Zeng, B. Benatallah, A. H. H. Ngu, M. Dumas, J. Kalagnanam and H. Chang, “QoS-Aware Middleware for Web Services Composition,” IEEE Transactions on Software Engineering, Vol. 30, No. 5, 2004, pp. 311-327.
[5] T. Osman, D. Thakker and D. Al-Dabass, “Semantic-Driven Matchmaking of Web Services Using Case-Based Reasoning, Icws 2006: Ieee International Conference on Web Services, Proceedings, USA, 2006, pp. 29-36.
[6] S.-C. Oh, D. Lee and S. R. T. Kumara, “Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm,” International Journal of Web Services Research, Vol. 4, No. 1, 2007, pp. 1-23.
[7] C. T. Kwok and D. S. Weld, “Planning to Gather Information,” Proceedings of the 13th National Conference on Artificial Intelligence (AAAI), Salt Lake City, 1996.
[8] R. B. Scherl and H. J. Levesque, “Knowledge, Action, and the Frame Problem,” Artificial Intelligence, Vol. 144, No. 1-2, 2003, pp. 1-39.
[9] M. Prokopenko, “A Preferential Semantics for Causal Reasoning about Action,” Annals of Mathematics and Artificial Intelligence, Vol. 46, No. 4, 2006, pp. 375-413.
[10] R. E. Fikes, and N. J. Nilsson, “STRIPS: A New Approachto Theorem Proving in Problem Solving,” Artificial Intelligence, Vol. 2, 1971, pp. 189-208.
[11] C. Castellini, E. Giunchiglia and A. Tacchella, “SAT-Based Planning in Complex Domains: Concurrency, Constraints and Nondeterminism,” Artificial Intelligence, Vol. 147, No. 1-2, 2003, pp. 85-117.
[12] S. Minton, M. D. Johnston, A. B. Philips and P. Laird, “Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems,” Artificial Intelligence, Vol. 58, 1990, pp. 161-205.
[13] S. Russell and P. Norvig, “Artificial Intelligence,” A modern approach, Prentice-Hall, 2004.
[14] K. H. Rosen, “Discrete Mathematics and Its Application,” China Machine Press, China, 1999, p. 678.
[15] B. Xu, T. Li, Z. Gu and G. Wu, “SWSDS: Quick Web Service Discovery and Composition in SEWSIP,” Proceedings of The 8th IEEE International Conference on E-Commerce Technology and the 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06) IEEE Computer Society, 2006, pp. 71-73.
[16] R. Sosic and J. Gu, “Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem,” IEEE Transactions on Knowledge and Data Engineering, 1994, Vol. 6, No. 5, pp. 661-668.
[17] X. Fu, T. Bultan and J. Su, “Analysis of Interacting BPEL Web Services,” Proceedings of the 13th International World Wide Web Conference (WWW'04), ACM Press, 2004.
[18] E. Sirin, B. Parsia, D. Wu, J. Hendler and D. Nau, “HTN Planning for Web Service Composition Using SHOP2,” Proceedings of 2nd International Semantic Web Conference (ISWC2003), 2003, pp. 20-23.
[19] D. Ardagna and B. Pernici, “Adaptive Service Composition in Flexible Processes,” IEEE Transactions on Software Engineering, Vol. 33, No. 6, 2007, pp. 369-384.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.