Abstract
Web Services are gained much popularity in business applications. There are many web services that can handle same requests. So to select better service from them is an important issue. In this paper, we study different selection algorithms that consider various constraints for better service selection, thereby provide better web service composition.
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
Zeng, L., Benatallah, B., Ngu, A., Dumas, M., Kalagnanam, J., Chang, H.: QoS-aware middleware for web services composition. IEEE Transactions on Software Engineering 30(5), 311–327 (2004)
Yu, T., Zhang, Y., Lin, K.-J.: Efficient algorithms for web services selection with end-to-end QoS constraints. ACM Trans. on Web 1(1), 6 (2007)
Yang, W.-L.: A comparison of two optimal approaches for the MCOP problem. Elsevier Ltd., Amsterdam, doi:10.1016/j.jnca.2003.10.003
Canfora, G., Di Penta, M., Esposito, R., Villani, M.L.: An Approach for QoS aware Service Composition based on Genetic Algorithms. In: ACM GECCO 2005 (June 25-29, 2005)
Tang, M., Ai, L.: A Hybrid Genetic Algorithm for the Optimal Constrained Web Service Selection Problem in Web Service Composition. In: 2010 IEEE Congress Evolutionary Computation, CEC (July 2010)
Li, L., Liu, C., Wang, J.: Deriving Transactional Properties of Composite Web Services. In: Proc. IEEE Int’l. Conf. Web Services (ICWS 2007), pp. 631–638 (July 2007)
El Haddad, J., Manouvrier, M., Rukoz, M.: TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition. IEEE Transactions on Services Computing 3(1) (January-March 2010)
Koduva, P.: Clustering Genetic Algorithm. In: 18th International Workshop on Database and Expert Systems Applications
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Johny, K., Jose, T. (2011). Algorithms for Efficient Web Service Selection with Different Constraints. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds) Advances in Parallel Distributed Computing. PDCTA 2011. Communications in Computer and Information Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24037-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-24037-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24036-2
Online ISBN: 978-3-642-24037-9
eBook Packages: Computer ScienceComputer Science (R0)