Pairwise Testing of Dynamic Composite Services

Ajay Kattepur 1 Sagar Sen 2 Benoit Baudry 3 Albert Benveniste 1 Claude Jard 1
1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
3 TRISKELL - Reliable and efficient component based software engineering
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Online services encapsulate enterprises, people, software systems and often operate in poorly understood environments. Using such services in tandem to predictably orchestrate a complex task is one of the principal challenges of service-oriented computing. A composite service orchestration soliciting multiple atomic services is plagued by a number of sources of variation. For instance, availability of an atomic service and its response time are two important sources of variation. Moreover, the number of possible variations in a composite service increases exponentially with increase in the number of atomic services. Testing such a composite service presents a crucial challenge as its often very expensive to exhaustively examine the variation space. Can we effectively test the dynamic behavior of a composite service using only a subset of these variations? This is the question that intrigues us. In this paper, we first model composite service variability as a feature diagram (FD) that captures all valid configurations of its orchestration. Second, we apply pairwise testing to sample the set of all possible configurations to obtain a concise subset. Finally, we test the composite service for selected pairwise configurations for a variety of QoS metrics such as response time, data quality, and availability. Using two case studies, Car crash crisis management and eHealth management, we demonstrate that pairwise generation effectively samples the full range of QoS variations in a dynamic orchestration. The pairwise sampling technique eliminates over $99\%$ redundancy in configurations, while still calling all atomic services at least once. We rigorously evaluate pairwise testing for the criteria such as: a) ability to sample the extreme QoS metrics of the service b) stable behavior of the extracted configurations c) compact set of configurations that can help evaluate QoS tradeoffs and d) comparison with random sampling.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
Contributor : Ajay Kattepur <>
Submitted on : Tuesday, November 15, 2011 - 3:11:59 PM
Last modification on : Friday, November 16, 2018 - 1:35:32 AM
Long-term archiving on : Thursday, February 16, 2012 - 2:27:27 AM


Files produced by the author(s)



Ajay Kattepur, Sagar Sen, Benoit Baudry, Albert Benveniste, Claude Jard. Pairwise Testing of Dynamic Composite Services. The 6th international symposium on Software engineering for adaptive and self-managing systems, SIGSOFT ACM Special Interest Group on Software Engineering, IEEE CS, May 2011, Waikiki, Honolulu, Hawaii, United States. pp.138--147, ⟨10.1145/1988008.1988028⟩. ⟨hal-00641340⟩



Record views


Files downloads