QoS-driven service selection and composition

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn , Issue , 2008, Pages 160-169

  Meng, Sun ^a   Arbab, Farhad ^a  

^a CWI   (Netherlands)

Author keywords

Composition; QoS; Quantitative constraint automata; Selection; Service

Indexed keywords

COMPOSITION; QOS; QUANTITATIVE CONSTRAINT AUTOMATA; SELECTION; SERVICE;

QUALITY OF SERVICE;

EID: 51549088368     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2008.4574608     Document Type: Conference Paper

References (32)

1. Farhad Arbab, Tom Chothia, Sun Meng, and Young-Joo Moon. Component Connectors with QoS Guarantees. In A. L. Murphy and J. Vitek, editor, Proceedings of 9th International Conference on Coordination Models and Languages, Coordination'07, volume 4467 of LNCS, pages 286-304. Springer, 2007.
2. Farhad Arbab and Jan Rutten. A coinductive calculus of component connectors. In M. Wirsing, D. Pattinson, and R. Hennicker, editors, Recent Trends in Algebraic Development Techniques: 16th International Workshop, WADT 2002, Frauenchiemsee, Germany, September 24-27, 2002, Revised Selected Papers, volume 2755 of LNCS, pages 34-55. Springer-Verlag, 2003.
3. Danilo Ardagna and Barbara Pernici. Adaptive Service Composition in Flexible Processes. IEEE Transactions on Software Engineering, 33:369-384, 2007.
4. Christel Baier, Marjan Sirjani, Farhad Arbab, and Jan Rutten. Modeling component connectors in Reo by constraint automata. Science of Computer Programming, 61:75-113, 2006.
5. M. Bernardo and R. Gorrieri. A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoretical Computer Science, 202:1-54, 1998.
6. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. JACM, 44(2):201-236, 1997.
7. Jorge Cardoso, Amit Sheth, John Miller, Jonathan Arnold, and Krys Kochut. Quality of service for work flows and web service processes. Web Semantics: Science, Services and Agents on the World Wide Web, 1(3):281-308, 2004.
8. Fabio Casati, Malú Castellanos, Umeshwar Dayal, and Ming-Chien Shan. Probabilistic, context-sensitive, and goal-oriented service selection. In Marco Aiello,Mikio Aoyama, Francisco Curbera, and Mike P. Papazoglou, editors, Service-Oriented Computing - ICSOC 2004, Second International Conference, New York, NY, USA, November 15-19, 2004, Proceedings, pages 316-321. ACM, 2004.
9. Tom Chothia and Jetty Kleijn. Q-Automata: Modelling the Resource Usage of Concurrent Components. In Proceedings of FOCLASA 2006, ENTCS, 2006.
10. Aiqiang Gao, Dongqing Yang, Shiwei Tang, and Ming Zhang. QoS-Driven Web Service Composition with Inter Service Conflicts. In X. Zhou et al., editor, AP-Web 2006, volume 3841 of LNCS, pages 121-132. Springer, 2006.
11. H. Hermanns, U. Herzog, and V. Mertsiotakis. Stochastic Process Algebras: Between LOTOS and Markov Chains. Computer Networks ISDN Systems, 30(9/10):901-924, 1998.
12. Holger Hermanns. InteractiveMarkov Chains And the Quest for Quantified Quality, volume 2428 of LNCS. Springer, 2002.
13. Holger Hermanns, Ulrich Herzog, and Joost-Pieter Katoen. Process algebra for performance evaluation. Theoretical Computer Science, 274:43-87, 2002.
14. Jane Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
15. Dan Hirsch, Alberto Lluch-Lafuente, and Emilio Tuosto. A logic for application level qos. Electronic Notes in Theoretical Computer Science, 153:135-159, 2006.
16. Dan Hirsch and Emilio Tuosto. SHReQ: A framework for coordinating application level qos. In Bernhard Aichernig and Bernhard Beckert, editors, SEFM2005, 3rd International Conference on Software Engineering and Formal Methods, pages 425-434. IEEE Computer Society Press, 2005.
17. C. L. Hwang and K. Yoon. Multiple Criteria Decision Making, Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, 1981.
18. M. C. Jaeger, G. Muhl, and S. Golze. QoS-Aware Composition of Web Services: An Evaluation of Selection Algorithms. In Proceedings of International Conference on Cooperative Information Systems, 2005.
19. G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315-352, 1995.
20. M. P. Papazoglou and D. Georgakopoulos. Service Oriented Computing. Comm. ACM, 46(10):25-28, 2003.
21. Marco Ajmone Marsan, Gianni Conte, and Gianfranco Balbo. A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems. ACM Transactions on Computer Systems, 2(2):93-122, 1984.
22. Sun Meng. QCCS: A Formal Model to Enforce QoS Requirements in Service Composition. In J. He and J. Sanders, editors, Proceedings of 1st IEEE & IFIP International Symposium on Theoretical Aspects of Software Engineering, TASE'07, pages 389-400. IEEE Computer Society, 2007.
23. Sun Meng and Farhad Arbab. Web Services Choreography and Orchestration in Reo and Constraint Automata. In Proceedings of 22nd Annual ACM Symposium on Applied Computing, SAC'07, pages 346-353, 2007.
24. R. De Nicola, G. Ferrari, U. Montanari, R. Pugliese, and E. Tuosto. A process calculus for qos-aware applications. In Coordination 2005, volume 3454 of LNCS, pages 33-48. Springer, 2005.
25. Rocco De Nicola, Gianluigi Ferrari, Ugo Montanari, Rosario Pugliese, and Emilio Tuosto. A Formal Basis for Reasoning on Programmable QoS. In N. Dershowitz, editor, Verfication (Manna Festschrift), volume 2772 of LNCS, pages 436-479. Springer, 2003.
26. X. Nicollin and J.Sifakis. An overview and synthesis on timed process algebras. In J. W. de Bakker, editor, Real-Time: Theory in Practice, volume 600 of LNCS, pages 526-548. Springer, 1992.
27. Michael P. Papazoglou, Paolo Traverso, Schahram Dustdar, and Frank Leymann. Service-Oriented Computing: State of the Art and Research Challenges. IEEE Computer, pages 64-71, 2007.
28. David Pym and Chris Tofts. A calculus and logic of resources and processes. Formal Aspects of Computing, 18:495-517, 2006.
29. R. A. Sahner and K. S. Trivedi. Performance and reliability analysis using directed acyclic graphs. IEEE Transactions on Software Engineering, 13(10):1105-1114, 1987.
30. Haifeng Yu and Amin Vahdat. The Costs and Limits of Availability for Replicated Services. ACM Transactions on Computer Systems, 24(1):70-113, 2006.
31. Tao Yu and Kwei-Jay Lin. Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints. In B. Benatallah, F. Casati, and P. Traverso, editors, ICSOC 2005, volume 3826 of LNCS, pages 130-143. Springer, 2005.
32. Liangzhao Zeng, Boualem Benatallah, Anne H.H. Ngu, Marlon Dumas, Jayant Kalagnanam, and Henry Chang. QoS-Aware Middleware for Web Services Composition. IEEE Transactions on Software Engineering, 30(5):311-327, 2004.