论文信息 - Using Pareto Principle to Improve Efficiency for Selection of Qos Web Services

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

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.

Lican Huang | Jianfeng Nie

[1] Yang Sheng. A Model for Web Service Discovery with QoS Constraints , 2005 .

[2] Marcel-Catalin Rosu,et al. A survey of public web services , 2004, WWW Alt. '04.

[3] Xiang Liu,et al. Web caching for database applications with Oracle Web Cache , 2002, SIGMOD '02.

[4] Guo De-ke,et al. A Web Services Selection and Ranking Model with QoS Constraints , 2007 .

[5] Yue Kun,et al. Underlying Techniques for Web Services: A Survey , 2004 .

[6] Eyhab Al-Masri,et al. A Framework for Efficient Discovery of Web Services Across Heterogeneous Registries , 2007, 2007 4th IEEE Consumer Communications and Networking Conference.

[7] Amit P. Sheth,et al. Modeling Quality of Service for Workflows and Web Service Processes , 2002 .

[8] Eyhab Al-Masri,et al. Discovering the best web service , 2007, WWW '07.