Biased covering arrays for progressive ranking and composition of Web Services. (27th July 2007)

• Record Type: Journal Article
• Authors: Bryce, Renee C.; Chen, Yinong; Colbourn, Charles J.
• Is Part Of: International journal of simulation and process modelling. Volume 3:Number 1/2(2007)
• Page Start: 80
• Page End: 87
• Publication Date: 2007-07-27
• Subjects: 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; Management -- Computer simulation -- Periodicals; Mathematical models -- Periodicals; Operations research -- Periodicals; Simulation methods -- Periodicals; 003.05
• Languages: English
• ISSNs: 1740-2123

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.