Using Pareto Principle to Improve Efficiency for Selection of Qos Web Services

Abstract

With the rapid increase of Web services, we can have a chance to select the best Qos Web Service among multiple candidate Web Services with the same semantic functions. To obtain the best Qos Web Service, a huge amount of computations on all the candidate Web Services are required to computed. This will lead to less efficiency. To improve selection performance, we use Pareto Principle to calculate only small part of Web Services.