Using pareto principle to improve efficiency for selection of QoS web services

Authors:
Lican Huang;Jianfeng Nie
Affiliations:
Institute of Networking & Distributed Computing, School of Informatics & Electronics, Zhejiang Sci-Tech University, HangZhou, P.R.China;Institute of Networking & Distributed Computing, School of Informatics & Electronics, Zhejiang Sci-Tech University, HangZhou, P.R.China
Venue:
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Year:
2010

Citing 2
Cited 0

Web caching for database applications with Oracle Web Cache

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A survey of public web services

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters

Quantified Score

Hi-index	0.00

Visualization

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.