Academic Journals Database
Disseminating quality controlled scientific knowledge

Progressive Ranking and Composition of Web Services with Interaction Relationship

ADD TO MY LIST
 
Author(s): Jianjun Yuan | Changjun Jiang | Zuowen Jiang

Journal: Journal of Software
ISSN 1796-217X

Volume: 5;
Issue: 8;
Start page: 842;
Date: 2010;
Original page

Keywords: service oriented architecture | web services | covering arrays | group testing | reliability

ABSTRACT
Service-oriented computing is a new software development paradigm that allows application developers to select available services from the Internet and to form new web services. A main problem is how to efficiently determine the most appropriate web services that will be combined into an application based on their functionalities, licensing costs, and reliability. Bryce et al. make use of the group testing results, and then progressively select the best component WS to construct the composite service by using interaction testing. However, they consider only pair-wise (2-way) interaction among any two component WS. In really composite service, there are not always interactions among any component WS, and some component WS may need N-way (N >2) testing since there is a closer relationship among them. We extend the model of interaction testing for WS with interaction relationship and propose a greedy algorithm for constructing variable covering arrays with bias. Experimental results show that our approach can cover more important interactions among web services earlier.
Affiliate Program      Why do you need a reservation system?