Bounding models families for performance evaluation in composite Web services

Serge Haddad 1, 2 Lynda Mokdad 3 Samir Youcef 4
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
4 SCORE - Services and Cooperation
Inria Nancy - Grand Est, LORIA - NSS - Department of Networks, Systems and Services
Abstract : One challenge of composite Web service architectures is the guarantee of the Quality of Service (QoS). Performance evaluation of these architectures is es- sential but complex due to synchronizations inside the orchestration of services. We propose methods to automatically derive from the original model a family of bounding models for the composite Web response time. These models allow to find the appropriate trade-o↵ between accuracy of the bounds and the com- putational complexity. The numerical results show the interest of our approach w.r.t complexity and accuracy of the response time bounds.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-00920332
Contributor : Samir Youcef <>
Submitted on : Wednesday, December 18, 2013 - 11:20:19 AM
Last modification on : Tuesday, December 18, 2018 - 4:26:01 PM

Identifiers

Citation

Serge Haddad, Lynda Mokdad, Samir Youcef. Bounding models families for performance evaluation in composite Web services. Journal of computational science, Elsevier, 2013, PEDISWESA 2011 and Sc. computing for Cog. Sciences, 4 (4), pp.232-241. ⟨10.1016/j.jocs.2011.11.003⟩. ⟨hal-00920332⟩

Share

Metrics

Record views

468