Abstract
Service-oriented computing promotes the construction of applications by composing distributed services that are advertised in an open service market. In such an environment, individual services may change and evolve dynamically, requiring composite services to adapt to such changes. The prevailing strategy is to react on failures and replace the defective component of the composite service. However, this reactive approach does not fully exploit the opportunities of a dynamic market where older services may be replaced by better ones.
In this paper we promote a novel architecture for automated, dynamic, pro-active, and transparent maintenance and improvement of composite services. We leverage fine-grained client-side monitoring techniques to generate information regarding functional and non-functional properties of service behavior. A reputation manager is responsible for collecting and aggregating this information, and provides economical incentives for honest sharing of feedback. Composite services can thus use reliable reputation information to pro-actively improve their aggregate performance.
Chapter PDF
Similar content being viewed by others
References
Andrews, T., Curbera, F., Dholakia, H., Goland, Y., Klein, J., Leymann, F., Liu, K., Roller, D., Smith, D., Thatte, S., Trickovic, I., Weerawarana, S.: Business Process Execution Language for Web Services, Version 1.1 (2003)
Baresi, L., Di Nitto, E., Ghezzi, C.: Towards Open-World Software. IEEE Computer 39, 36–43 (2006)
Singh, M.P., Huhns, M.N.: Service-Oriented Computing. Wiley, Chichester (2005)
Zacharia, G., Maes, P.: Trust management through reputation mechanisms. Applied Artificial Intelligence (14), 881–907 (2000)
Maximilien, E.M., Singh, M.P.: Conceptual model of web service reputation. SIGMOD Rec. 31(4), 36–41 (2002)
Liu, Y., Ngu, A.H., Zeng, L.Z.: Qos computation and policing in dynamic web service selection. In: WWW Alt. 2004. Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pp. 66–73. ACM Press, New York, NY, USA (2004)
Maximilien, E.M., Singh, M.P.: Toward autonomic web services trust and selection. In: ICSOC 2004. Proceedings of the 2nd international conference on Service oriented computing, pp. 212–221. ACM Press, New York, NY, USA (2004)
Alunkal, B., Veljkovic, I., Laszewski, G., Amin, K.: Reputation-Based Grid Resource Selection. In: Proceedings of AGridM (2003)
Baresi, L., Bianculli, D., Ghezzi, C., Guinea, S., Spoletini, P.: A timed extension of WSCoL. In: ICWS 2007. Proceedings of the IEEE International Conference on Web Services, pp. 663–670. IEEE Computer Society Press, Los Alamitos (2007)
Constantinescu, I., Binder, W., Faltings, B.: Flexible and efficient matchmaking and ranking in service directories. In: ICWS 2005. Proceedings of the IEEE International Conference on Web Services, pp. 5–12. IEEE Computer Society Press, Los Alamitos (2005)
Kiczales, G., Lamping, J., Mendhekar, A., Maeda, C., Lopes, C.V., Loingtier, J., Irwin, J.: Aspect-oriented programming. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol. 1241, pp. 220–242. Springer, Heidelberg (1997)
Forney, G.: The Viterbi algorithm. Proceedings IEEE 61, 268–278 (1973)
Jurca, R., Faltings, B., Binder, W.: Reliable QoS monitoring based on client feedback. In: WWW 2007. Proceedings of the 16th international conference on World Wide Web, pp. 1003–1012. ACM Press, New York, NY, USA (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bianculli, D., Jurca, R., Binder, W., Ghezzi, C., Faltings, B. (2007). Automated Dynamic Maintenance of Composite Services Based on Service Reputation. In: Krämer, B.J., Lin, KJ., Narasimhan, P. (eds) Service-Oriented Computing – ICSOC 2007. ICSOC 2007. Lecture Notes in Computer Science, vol 4749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74974-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-74974-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74973-8
Online ISBN: 978-3-540-74974-5
eBook Packages: Computer ScienceComputer Science (R0)