Towards an efficient and a more accurate web service selection using MCDM methods

Serrai, Walid; Abdelli, Abdelkrim; Mokdad, Lynda; Hammal, Youcef

doi:10.1016/j.jocs.2017.05.024

Cited by 97 publications

(44 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate the pertinence and the accuracy of the four tested MCDM ranking approaches, we consider the same solution defined in our other work that relies on computing the compromise solution by using the B o r d a technique…”

Section: Description Of Our Web Service Selection Approachmentioning

confidence: 99%

“…Each Web service i receives some votes at different ranking positions. Then, the Borda score of the Web service i is obtained by aggregating the different L rankings, as follows:…”

Section: Description Of Our Web Service Selection Approachmentioning

confidence: 99%

“…Indeed, there is a variety of MCDM methods that use an objective function, which has numeric weighting factors to encode user's requirements, and to cope with Web service selection specificities. Using MCDM based approaches in Web service selection requires to follow usually different steps: A set of candidate Web services is first determined by matching their functional requirements with those expressed in the user request. Then, the QoS criteria are considered to select the best Web service within this set.…”

Section: Introductionmentioning

confidence: 99%

“…In other respects, we have shown in our other work that the results obtained by using different MCDM ranking methods tend to diverge when the number of Web services is augmented. Indeed, since each method adopts its own philosophy in data normalization and coefficients computation there exists no guarantee that using a specific ranking method yields a consistent result.…”

Section: Introductionmentioning

confidence: 99%

“…To compare the consistency of the ranking process by using these methods, we use the approach defined in our other work that relies on computing the Borda solution and different similarity ratios. Finally, to validate the approach, we conducted different tests on a real dataset and on an artificial one that compare the runtime and the resulting rankings of each technique.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

How to deal with QoS value constraints in MCDM based Web service selection

Serrai

Abdelli

Mokdad

et al. 2018

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary The aim of the current research is to develop a more accurate Web service selection approach that can deal with value constraints on QoS criteria in the user request. The purpose is to be able to promote services even when all the value constraints are not satisfied and hence rank them according to their closeness to meet the latter. For this effect, we use MCDM (Multi Criteria Decision making) methods together with suitable normalization techniques at different stages of the process. First of all, we consider an extension of the AHP method to compute and normalize the weights associated with the QoS criteria considered in the Web service selection. Second, we introduce a more consistent normalization technique, called OMRI, to normalize data according to value constraints. Third, we propose to extend different ranking MCDM methods to the OMRI normalization so that it becomes possible for them to cope with value constraints. The considered methods are SAW, TOPSIS, VIKOR, and WPM. To compare the accuracy of the extended ranking methods, we use the Borda compromise solution together with different similarity ratios. To validate the solution, several experiments have been conducted on a real dataset as well as on an artificial one.

show abstract

Section: Description Of Our Web Service Selection Approachmentioning

confidence: 99%

“…Each Web service i receives some votes at different ranking positions. Then, the Borda score of the Web service i is obtained by aggregating the different L rankings, as follows:…”

Section: Description Of Our Web Service Selection Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

How to deal with QoS value constraints in MCDM based Web service selection

Serrai

Abdelli

Mokdad

et al. 2018

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

Multicriteria decision‐making techniques for avoiding similar task scheduling conflict in cloud computing

Nayak

Parida²,

Tripathy

et al. 2019

Int J Communication

View full text Add to dashboard Cite

SummaryAn efficient task scheduling approach shows promising way to achieve better resource utilization in cloud computing. Various task scheduling approaches with optimization and decision‐making techniques have been discussed up to now. These approaches ignored scheduling conflict among the similar tasks. The conflict often leads to miss the deadlines of the tasks. The work studies the implementation of the MCDM (multicriteria decision‐making) techniques in backfilling algorithm to execute deadline‐based tasks in cloud computing. In general, the tasks are selected as backfill tasks, whose role is to provide ideal resources to other tasks in the backfilling approach. The selection of the backfill task is challenging one, when there are similar tasks. It creates conflict in the scheduling. In cloud computing, the deadline‐based tasks have multiple parameters such as arrival time, number of VMs (virtual machines), start time, duration of execution, and deadline. In this work, we present the deadline‐based task scheduling algorithm as an MCDM problem and discuss the MCDM techniques: AHP (Analytical Hierarchy Process), VIKOR (VIseKriterijumska Optimizacija I Kompromisno Resenje), and TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) to avoid similar task scheduling conflicts. We simulate the backfilling algorithm along with three MCDM mechanisms to avoid scheduling conflicts among the similar tasks. The synthetic workloads are considered to study the performance of the proposed scheduling algorithm. The mechanism suggests an efficient VM allocation and its utilization for deadline‐based tasks in the cloud environment.

show abstract

Sustainable Urban Freight Strategies for Jaipur City, India

Kant

Gupta

2020

Smart and Sustainable Supply Chain and Logistics – Trends, Challenges, Methods and Best Practices

View full text Add to dashboard Cite

Towards an efficient and a more accurate web service selection using MCDM methods

Cited by 97 publications

References 20 publications

How to deal with QoS value constraints in MCDM based Web service selection

How to deal with QoS value constraints in MCDM based Web service selection

Multicriteria decision‐making techniques for avoiding similar task scheduling conflict in cloud computing

Sustainable Urban Freight Strategies for Jaipur City, India

Contact Info

Product

Resources

About