Web Service Composition Based on Qualitative Parameters Using Top-K Color Classification
Service-oriented architecture is the key to run web services. It has been a promising solution for composing services. Given the increase and complexity of the users’ needs, atomic services will not be adequate in service-oriented systems. Thus, drawing on the ability to compose services, scholars are searching for an optimal composition with identical efficiency among web services. Of course, service composition involves attention to the users’ needs and adapting them to qualitative parameters as the non-performance requirements of the system during the composition. The composition of automatic services will be a useful technology in composing multiple atomic services; however, the present attempts do not bring about the favourable efficacy. Many methods have been proposed by the researchers for composition of automatic services. However, in this paper an effort has been made to ameliorate the defects by introducing changes in Top-K algorithm. In the proposed method, the concept of ‘color’ has been employed in the section dealing with service composition in order to discard the backtracking technique in Top-K algorithm and the objective is to increase efficacy in composing web services and improve the time in the execution of the composition process. The proposed method improves the rate and accuracy of algorithm execution by displaying the services using graphs and the implemented color. Compared to the existing methods, the evaluation of the recommended method indicates a drop in memory usage, an increase in the speed of algorithm execution and the achievement of optimal results in less time.
Deng, D., Huang, S., Tan, L., & Wu, Z. (2014). Top-Automatic Service Composition: A Parallel Method for Large-Scale Service Sets. IEEE Transactions on Automation Science and Engineering, 11(3), pp. 891-905.
Deng, S., Wu, B., Yin, J., & Wu, Z. (2013). Efficient planning for top-K Web service composition. Knowledge and information systems, 36(3), 579-605.
Hennig, P., & Balke, W. T. (2010, July). Highly scalable web service composition using binary tree-based parallelization. IEEE International Conference on In Web Services (ICWS), (pp. 123-130).
Jiang, W., Hu, S., & Liu, Z. (2014). Top k query for QoS-aware automatic service composition. IEEE Transactions on Services Computing, 7(4), 681-695.
Pejman, E., Rastegari, Y., Esfahani, P. M., & Salajegheh, A. (2012, March). Web service composition methods: A survey. In Proceedings of the International MultiConference of Engineers and Computer Scientists (Vol. 1).
Navarro, G., & Nekrich, Y. (2012, January). Top-k document retrieval in optimal time and linear space. Society for Industrial and Applied Mathematics. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms (pp. 1066-1077).
Safi, A., Jawawi, D. N., & Wakil, K. (2013, December). Web services composition with redundancy consideration. IEEE Conference on Open Systems (ICOS), (pp. 112-117).
Shen, Y., Yang, X., Wang, Y., & Ye, Z. (2012, June). Optimizing QoS-aware services composition for concurrent processes in dynamic resource-constrained environments. IEEE 19th International Conference on In Web Services (ICWS), (pp. 250-258).
Wagner, F., Ishikawa, F., & Honiden, S. (2011, July). QoS-aware automatic service composition by applying functional clustering. IEEE International Conference on In Web Services (ICWS), (pp. 89-96).
Zeng, L., Benatallah, B., Ngu, A. H., Dumas, M., Kalagnanam, J., & Chang, H. (2004). Qos-aware middleware for web services composition. IEEE Transactions on software engineering, 30(5), 311-327.
Zhang, W., Chang, C. K., Feng, T., & Jiang, H. Y. (2010, July). QoS-based dynamic web service composition with ant colony optimization. IEEE 34th Annual. In Computer Software and Applications Conference (COMPSAC), (pp. 493-502).
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.