Title: Biased covering arrays for progressive ranking and composition of Web Services

Authors: Renee C. Bryce, Yinong Chen, Charles J. Colbourn

Addresses: Department of Computer Science, University of Nevada at Las Vegas, Las Vegas, NV 89154, USA. ' Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85257, USA. ' Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85257, USA

Abstract: Service-oriented computing is a new software development paradigm that allows application builders to choose from many available services. The challenges are to efficiently determine which services are the most appropriate to combine into an application based on concerns such as functionalities, licensing costs, and known reliability. Group testing has addressed some issues on how to select a small subset of candidate services. We expand upon the group testing methodology with a greedy algorithm that generates biased covering arrays for interactive testing of the services selected by group testing.

Keywords: biased covering arrays; covering arrays; group testing; mixed-level covering arrays; pair-wise interaction testing; reliability; service-oriented architecture; web services; service-oriented computing; web service ranking; web service composition.

DOI: 10.1504/IJSPM.2007.014717

International Journal of Simulation and Process Modelling, 2007 Vol.3 No.1/2, pp.80 - 87

Available online: 26 Jul 2007 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article