Abstract
Since increasing services are deployed and published, service composition selection has became a crucial issue of Service-Oriented Computing (SOC). To address the issue, the paper proposed a novel selection algorithm based on the principle of divide and rule. We first construct a linear programming model to describe service selection problem; we then decompose the model into small subproblems by means of resource-directive decomposition technique. To obtain near-to-optimal resource allocation, we employ subgradient algorithm to search appropriate solution. To demonstrate our approach, we conducted a series of experiments to compare the performance of our approach with others.
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
Al-Masri, E., Mahmoud, Q.H.: Investigating web services on the world wide web. In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, pp. 795–804. ACM, New York (2008)
Alrifai, M., Risse, T., Dolog, P., Nejdl, W.: A scalable approach for QoS-based web service selection. In: Feuerlicht, G., Lamersdorf, W. (eds.) ICSOC 2008. LNCS, vol. 5472, pp. 190–199. Springer, Heidelberg (2009)
Alrifai, M., Risse, T., Nejdl, W.: A hybrid approach for efficient web service composition with end-to-end qos constraints. ACM Trans. Web 6(2), 7:1–7:31 (2012)
Ardagna, D., Pernici, B.: Adaptive service composition in flexible processes. IEEE Trans. Softw. Eng. 33(6), 369–384 (2007)
Bayen, A.M., Sun, D., Clinet, A.: A dual decomposition method for sector capacity constrained traffic flow optimization. Transportation Research 45, 880–902 (2011)
Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Management Science 50(12), 1861–1871 (2004)
Geoffrion, A.M.: Primal resource-directive approaches for optimizing nonlinear decomposable systems. Operations Research 18(3), 375–403 (1970)
Jiang, D., Xue, J., Xie, W.: A reputation model based on hierarchical bayesian estimation for web services. In: Proceedings of the 2012 IEEE 16th International Conference on Computer Supported Cooperative Work in Design, pp. 88–93 (2012)
Sun, S.X., Zhao, J.: A decomposition-based approach for service composition with global qos guarantees. Inf. Sci. 199, 138–153 (2012)
Wang, S.-H.: An improved stepsize of the subgradient algorithm for solving the lagrangian relaxation problem. Computers & Electrical Engineering 29(1), 245–249 (2003)
Yu, Q., Bouguettaya, A.: Multi-attribute optimization in service selection. World Wide Web 15(1), 1–31 (2012)
Yu, T., Lin, K.-J.: Service selection algorithms for web services with end-to-end qos constraints. In: Proceedings of the IEEE International Conference on e-Commerce Technology, CEC 2004, pp. 129–136 (July 2004)
Zeng, L., Benatallah, B., Dumas, M., Kalagnanam, J., Sheng, Q.Z.: Quality driven web services composition. In: Proceedings of the 12th International Conference on World Wide Web, WWW 2003, pp. 411–421. ACM, New York (2003)
Zeng, L., Benatallah, B., Ngu, A.H.H., Dumas, M., Kalagnanam, J., Chang, H.: Qos-aware middleware for web services composition. IEEE Trans. Softw. Eng. 30(5), 311–327 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, D., Jiang, Y., Xie, W., You, Z. (2013). A Novel Service Selection Based on Resource-Directive Decomposition. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_66
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)