Implementing weighted entropy-distance based approach for the selection of software reliability growth models
by Aakash Gupta; Neeraj Gupta; Ramesh Kumar Garg
International Journal of Computer Applications in Technology (IJCAT), Vol. 57, No. 3, 2018

Abstract: A computational quantitative model based on Weighted Euclidean Distance Based Approximation (WEBDA) has been developed to evaluate selection and rank the Software Reliability Growth Models (SRGMs) in ascending or descending order based on their Euclidean distance value from the optimal SRGM. The SRGM with Rank 1 is considered the optimal selection for the software developers on the particular dataset under consideration. The main problem of SRGMs selection and ranking is deployed as a multi-criteria decision making (MCDM) problem in which numerous inter-related attributes collectively termed as ranking criteria are identified to make the evaluation of available alternatives. In the present research, a data set from Tandem Computer Software Failure has been used to show the utility of developed model. Further the concept of methodology validation strengthens the present research by doing the comparison of obtained results with that of existing MCDM approaches such as Analytical Hierarchy Processing (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS).

Online publication date: Wed, 04-Jul-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email