Assessing service protocol adaptability based on protocol reduction and graph search - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2011

Assessing service protocol adaptability based on protocol reduction and graph search

Résumé

Given the inherent autonomy, heterogeneity, and continuous evolution of Web services, mismatches usually exist between service protocols. Adapters are typically used to reconcile these mismatches. Before synthesizing an adapter, a service requestor is often willing to assess whether her expected interactions can be conducted or not. The effort of synthesizing an adapter is beneficial only if the result of this assessment is positive. Previous effort analyzing service interactions focused on either (i) compatibility analysis for checking whether interactions can be conducted in a direct manner or (ii) adapter synthesization for reconciling mismatches. In this paper we propose a new kind of adaptability assessment that (i) determines whether two service protocols of a requestor and a provider are adaptable, (ii) computes an adaptation degree, and (iii) identifies conditions that determine when these two service protocols can be adapted. This adaptability assessment provides complementary criteria to the service requestor for selecting a suitable service protocol from a set of functionally equivalent candidates according to her requirements.

Dates et versions

hal-00628090 , version 1 (30-09-2011)

Identifiants

Citer

Zhangbing Zhou, Sami Bhiri, Hai Zhuge, Manfred Hauswirth. Assessing service protocol adaptability based on protocol reduction and graph search. Concurrency and Computation: Practice and Experience, 2011, 23 (9), pp.880-904. ⟨10.1002/cpe.1630⟩. ⟨hal-00628090⟩
84 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More