A RANKING MECHANISM FOR BETTER RETRIEVAL OF DATA FROM

Most of the web services run on cloud because of the pay-as –you –go concept of cloud. Users always require the best service for any specific application. But the challenge arises in determining the best cloud computing service for a specific application. As cloud can support large number of users some situation occurs wherein the cloud service providers are not able to deliver the requested services within the requested time. In order to rank for better services QoS values are required and each user should rank for each web services but it is not time efficient as well as cost effective. In order to avoid this scenario we propose an approach which directly predicts the QoS ranking by taking past QoS data of other consumers without checking for the subsequent QoS values of other web services. An enhanced greedy algorithm is proposed to provide better accuracy.This paper also compares enhanced greedy algorithm along with greedy algorithm. Keywords—Quality-of-service, cloud service, greedy algorithm 1