Abstract
In this paper, we study the dynamic service composition becomes a decision problem on which component services should be selected under the E2E QoS constraints. This problem is modeled is a nonlinear optimization problem under several constraints. We have two approaches: local selection is an efficient strategy with polynomial time complexity but can not handle global constraints and the traditional global selection approach based on integer linear programming can handle global constraints, but its poor performance renders it inappropriate for practical applications with dynamic requirements. To overcome this disadvantage,, we proposed a novel Min-Max Ant System algorithm with the utilities heuristic information to search the global approximate optimal. The experiment results show that our algorithm is efficiency and feasibility more than the recently proposed related algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yu, T., Lin, K.J.: Service selection algorithms for Web services with end-to-end QoS constraints. In: Proceeding of ISeB, pp. 103–126. Springer (2005)
Ma, X., Dong, B.: AND/OR Tree-based Approach for Web Service Composition. Journal of Computational Information Systems 5(2), 727–728 (2009)
Yu, T., Zhang, Y., Lin, K.J.: Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints. ACM Trans. on the Web 1, 1–26 (2007)
Zeng, L., Benatallah, B., Dumas, M., Kalagnanam, J., Sheng, Q.Z.: Quality Driven Web Service Composition. In: Proc. 12th International WWW Conference (2003)
Shankar, M., De Miguel, M., Liu, J.W.S.: An end-to-end QoS management architecture. In: Proceeding of 5th Real-Time Technology and Applications Symposium (1999)
Michlmayr, A., et al.: E2E support for QoS-Aware service selection, binding, and mediation in VRESCo. IEEE Trans. on Services Computing 3(3), 193–205 (2010)
Masri, E.A., et al.: Investigating web services on the world wide web. In: Proceedings of the International Conference on World Wide Web, China, pp. 795–804 (2008)
Ardagna, D., Pernici, B.: Adaptive service composition in flexible processes. IEEE Trans. on Software Engineering 33(6), 369–384 (2007)
Zeng, L., Benatallah, B.: QoS-Aware Middle-ware for Web Services Composition. IEEE Transactions on Software Engineering 30(5), 321–322 (2004)
Wu, M., et al.: Qos-driven Global Optimization Approach for Large-scale Web Services Composition. Journal of Computers 6(7), 1452–1456 (2011)
Zhang, C., et al.: DiGA: population diversity handling genetic algorithm for QoS-Aware web services selection. Computer Comm. 30(5), 1082–1090 (2007)
Liu, S.L., et al.: A Dynamic Web Services Selection Algorithm with QoS Global Optimal in Web Services Composition. Journal of Software 18(3), 651–655 (2007)
Su, K., Liangli, M., Xiaoming, G., Yufei, S.: An Efficient Parameter-adaptive Genetic Algorithm for Service Selection with End-to-end QoS Constraints. Journal of Computational Information Systems 10(2), 581–588 (2014)
Su, K., et al.: An Efficient Discrete Invasive Weed Optimization Algorithm for Web Services Selection. Journal of Software 9(3), 709–715 (2014)
Fan, X.Q., et al.: Research on Web service selection based on cooperative evolution. Expert Systems with Applications 38(8), 9736–9743 (2011)
Xia, Y.M., et al.: Optimizing services composition based on improved ant colony algorithm. Chinese Journal of Computers 35(2), 270–281 (2012)
Zhang, C., Yin, H., Zhang, B.: A Novel Ant Colony Optimization Algorithm for Large Scale QoS-Based Service Selection Problem. Discrete Dynamics in Nature and Society 2013, 1–9 (2013)
Liu, Y., Ngu, A.H.H., Zeng, L.: QoS Computation and Policing in Dynamic Web Service Selection. In: Proceedings of the International World Wide Web Conference, pp. 66–73 (2004)
Ran, S.: A Model for Web Services Discovery With QoS, pp. 6–9. ACM (2003)
Seekda, http://webservices.seekda.com/
Stutzle, et al.: Max-min ant system. Future Generation Computer Systems, 889–914 (2000)
Le, D.-N.: Evaluation of Pheromone Update in Min-Max Ant System Algorithm to Optimizing QoS for Multimedia Services in NGNs. In: Satapathy, S.C., Govardhan, A., Raju, K.S., Mandal, J.K. (eds.) Emerging ICT for Bridging the Future - Volume 2. AISC, vol. 338, pp. 9–18. Springer, Heidelberg (2014)
Al-Masri, E., Mahmoud, Q.H.: The qws dataset  qmahmoud/qws/index.html, http://www.uoguelph.ca/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le, DN., Nguyen, G.N. (2015). A New Ant-Based Approach for Optimal Service Selection with E2E QoS Constraints. In: Intan, R., Chi, CH., Palit, H., Santoso, L. (eds) Intelligence in the Era of Big Data. ICSIIT 2015. Communications in Computer and Information Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46742-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-46742-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46741-1
Online ISBN: 978-3-662-46742-8
eBook Packages: Computer ScienceComputer Science (R0)