QoS-Driven Service Selection and Composition Using Quantitative Constraint Automata

• Autorzy: Sun M. , Arbab F.
• Języki publikacji: EN

Abstrakty

EN

Assuring Quality of Service (QoS) properties is critical in Service-Oriented Application (SOA) development. In this paper, we present an approach for specifying the QoS properties of services along multiple dimensions and selecting services for their composition in a way that optimizes the QoS of the result. We apply the integration of concerns paradigm to allow combined specification of QoS and functional properties by using Quantitative Constraint Automata, which integrate QoS aspects into service-oriented application development processes, mainly for service selection and composition.

Słowa kluczowe

EN

service; selection; composition; QoS; Quantitative Constraint Automata

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 95, nr 1
• Strony: 103--128
• Opis fizyczny: Bibliogr. 43 poz.

Twórcy

autor

Sun M.

autor

Arbab F.

• CWI, Science Park 123, Amsterdam, The Netherlands,

Bibliografia

• [1] Eclipse Coordination Tools, http://reo.project.cwi.nl/.
• [2] Arbab, F.: Reo: A Channel-based Coordination Model for Component Composition, Mathematical Structures in Computer Science, 14(3), 2004, 329-366.
• [3] Arbab, F., Chothia, T., Sun, M., Moon, Y.-J.: Component Connectors with QoS Guarantees, in: Proceedings of 9th International Conference on Coordination Models and Languages, Coordination'07 (A. L. Murphy and J. Vitek, Ed.), vol. 4467 of LNCS, Springer, 2007, 286-304.
• [4] Ardagna, D., Pernici, B.: Adaptive Service Composition in Flexible Processes, IEEE Transactions on Software Engineering, 33, 2007, 369-384.
• [5] Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata, Science of Computer Programming, 61, 2006, 75-113.
• [6] Bernardo, M., Gorrieri, R.: A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time, Theoretical Computer Science, 202, 1998, 1-54.
• [7] Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization, Journal of the ACM, 44(2), 1997, 201-236.
• [8] Bolch, G., Greiner, S., de Meer, H., Trivedi, K. S.: Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications, John Wiley, 2006.
• [9] Cardoso, J., Sheth, A., Miller, J., Arnold, J., Kochut, K.: Quality of service for work flows and web service processes, Web Semantics: Science, Services and Agents on the World Wide Web, 1(3), 2004, 281-308.
• [10] Casati, F., Castellanos, M., Dayal, U., Shan, M.-C.: Probabilistic, Context-Sensitive, and Goal-Oriented Service Selection, in: Service-Oriented Computing - ICSOC 2004, Second International Conference, New York, NY, USA, November 15-19, 2004, Proceedings (M. Aiello, M. Aoyama, F. Curbera, M. P. Papazoglou, Eds.), ACM, 2004, 316-321.
• [11] Chothia, T., Kleijn, J.: Q-Automata: Modelling the Resource Usage of Concurrent Components, Electronic Notes in Theoretical Computer Science, 175(2), 2007, 153-167.
• [12] Clarke, E. M., Emerson, E. A., Sistla, A. P.: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems, 8(2), 1986, 244-263.
• [13] Gao, A., Yang, D., Tang, S., Zhang, M.: QoS-Driven Web Service Composition with Inter Service Conflicts, in: Frontiers of WWW Research and Development - APWeb 2006 (X. Zhou et al., Ed.), vol. 3841 of LNCS, Springer, 2006, 121-132.
• [14] Hermanns, H.: Interactive Markov Chains And the Quest for Quantified Quality, Springer, 2002.
• [15] Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation, Theoretical Computer Science, 274, 2002, 43-87.
• [16] Hermanns, H., Herzog, U., Mertsiotakis, V.: Stochastic Process Algebras: Between LOTOS and Markov Chains, Computer Networks ISDN Systems, 30(9/10), 1998, 901-924.
• [17] Hillston, J.: A Compositional Approach to Performance Modelling, Cambridge University Press, 1996.
• [18] Hirsch, D., Lluch-Lafuente, A., Tuosto, E.: A Logic for Application Level QoS, Electronic Notes in Theoretical Computer Science, 153, 2006, 135-159.
• [19] Hirsch, D., Tuosto, E.: SHReQ: A Framework for Coordinating Application Level QoS, in: SEFM2005, 3rd International Conference on Software Engineering and Formal Methods (B. Aichernig, B. Beckert, Eds.), IEEE Computer Society Press, 2005, 425-434.
• [20] Hoare, C. A. R.: Communicating Sequential Processes, Prentice Hall International, 1985.
• [21] Hwang, C. L., Yoon, K.: Multiple Criteria Decision Making, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 1981.
• [22] Jaeger, M. C., Mühl, G., Golze, S.: QoS-Aware Composition of Web Services: An Evaluation of Selection Algorithms, in: On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE, OTM Confederated International Conferences CoopIS, DOA, and ODBASE 2005, Agia Napa, Cyprus, October 31 - November 4, 2005, Proceedings, Part I, vol. 3760 of LNCS, Springer, 2005, 646-661.
• [23] Leong, F., Mylavarabhata, S. P., Nguyen, T., Quemada, F.: Distributed Processing Environment: A Platform for Distributed Telecommunications Applications, Hewlett-Packard Journal Online, 47(5), 1996, 1-6, available at http://www.hpl.hp.com/hpjournal/96oct/oct96a2.pdf.
• [24] Lowe, G.: Probabilistic and prioritized models of timed CSP, Theoretical Computer Science, 138, 1995, 315-352.
• [25] Marsan, M. A., Conte, G., Balbo, G.: A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems, ACM Transactions on Computer Systems, 2(2), 1984, 93-122.
• [26] Menascé, D. A.: Composing Web Services: A QoS View, IEEE Internet Computing, 8(6), 2004, 88-90.
• [27] Milanovic, N., Malek, M.: Current Solutions for Web Service Composition, IEEE Internet Computing, 8, 2004, 51-59.
• [28] Milner, R.: An algebraic definition of simulation between programs, in: Proceedings of the 2nd International Joint Conference on Artificial Intelligence, London, UK (D. C. Cooper, Ed.), William Kaufmann, British Computer Society, 1971, 481-489.
• [29] Milner, R.: Communication and Concurrency, Prentice Hall, 1989.
• [30] Nicola, R. D., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E.: A Formal Basis for Reasoning on Programmable QoS, in: Verification: Theory and Practice (N. Dershowitz, Ed.), vol. 2772 of LNCS, Springer, 2003, 436-479.
• [31] Nicola, R. D., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E.: A Process Calculus for QoS-aware Applications, in: Coordination 2005, vol. 3454 of LNCS, Springer, 2005, 33-48.
• [32] Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras, in: Real-Time: Theory in Practice (J. W. de Bakker, Ed.), vol. 600 of LNCS, Springer, 1992, 526-548.
• [33] Papazoglou, M. P., Georgakopoulos, D.: Service Oriented Computing, Communications of the ACM, 46(10), 2003, 25-28.
• [34] Papazoglou, M. P., Traverso, P., Dustdar, S., Leymann, F.: Service-Oriented Computing: State of the Art and Research Challenges, IEEE Computer, 2007, 64-71.
• [35] Pym, D., Tofts, C.: A calculus and logic of resources and processes, Formal Aspects of Computing, 18, 2006, 495-517.
• [36] Sahner, R. A., Trivedi, K. S.: Performance and reliability analysis using directed acyclic graphs, IEEE Transactions on Software Engineering, 13(10), 1987, 1105-1114.
• [37] Sun, M.: QCCS: A Formal Model to Enforce QoS Requirements in Service Composition, in: Proceedings of 1st IEEE & IFIP International Symposium on Theoretical Aspects of Software Engineering, TASE'07 (J. He, J. Sanders, Eds.), IEEE Computer Society, 2007, 389-400.
• [38] Sun, M., Arbab, F.: Web Services Choreography and Orchestration in Reo and Constraint Automata, in: Proceedings of 22nd Annual ACM Symposium on Applied Computing, SAC'07, 2007, 346-353.
• [39] Tarnay, K.: Protocol Specification and Testing, Plenum Press, 1991.
• [40] Wolsey, L. A.: Integer Programming, Wiley-Interscience, 1998.
• [41] Yu, H., Vahdat, A.: The Costs and Limits of Availability for Replicated Services, ACM Transactions on Computer Systems, 24(1), 2006, 70-113.
• [42] Yu, T., Lin, K.-J.: Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints, in: ICSOC 2005 (B. Benatallah, F. Casati, P. Traverso, Eds.), vol. 3826 of LNCS, Springer, 2005, 130-143.
• [43] Zeng, L., Benatallah, B., Ngu, A. H., Dumas, M., Kalagnanam, J., Chang, H.: QoS-Aware Middleware for Web Services Composition, IEEE Transactions on Software Engineering, 30(5), 2004, 311-327.