CloudRank: A QoS-Driven Component Ranking Framework for Cloud Computing
Published 1 October 2010
Zibin Zheng, Yilei Zhang, Michael R. Lyu
Citations99
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper proposes a QoS-driven component ranking framework for cloud applications by taking advantage of the past component usage experiences of different component users, and shows that this approach outperforms the competing approaches.
Abstract
The rising popularity of cloud computing makes building high quality cloud applications a critical and urgently required research problem. Component quality ranking approaches are crucial for making optimal component selection from a set of functionally equivalent component candidates. Moreover, quality ranking of cloud components helps the application designers detect the poor performing components in the complex cloud applications, which usually include huge number of distributed components. To provide personalized cloud component ranking for different designers of cloud applications, this paper proposes a QoS-driven component ranking framework for cloud applications by taking advantage of the past component usage experiences of different component users. Our approach requires no additional invocations of the cloud components on behalf of the application designers. The extensive experimental results show that our approach outperforms the competing approaches.
Keywords
Computer ScienceDecision Sciences
Item-based collaborative filtering recommendation algorithms
9,017 Citations2001Badrul Sarwar, George Karypis +2 more
This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.
Above the Clouds: A Berkeley View of Cloud Computing
5,742 Citations2009Michael Armbrust, Armando Fox +9 more
This work focuses on SaaS Providers (Cloud Users) and Cloud Providers, which have received less attention than SAAS Users, and uses the term Private Cloud to refer to internal datacenters of a business or other organization, not made available to the general public.
IEEE Internet ComputingAmazon.com recommendations: item-to-item collaborative filtering
5,369 Citations2003Greg Linden, Brent Smith +1 more
This work compares three common approaches to solving the recommendation problem: traditional collaborative filtering, cluster models, and search-based methods, and their algorithm, which is called item-to-item collaborative filtering.
ACM Transactions on Information SystemsCumulated gain-based evaluation of IR techniques
4,634 Citations2002Kalervo Järvelin, Jaana Kekäläinen
This article proposes several novel measures that compute the cumulative gain the user obtains by examining the retrieval result up to a given ranked position, and test results indicate that the proposed measures credit IR methods for their ability to retrieve highly relevant documents and allow testing of statistical significance of effectiveness differences.
arXiv (Cornell University)Empirical Analysis of Predictive Algorithms for Collaborative Filtering
4,515 Citations2013John S. Breese, David Heckerman +1 more
User Modeling and User-Adapted InteractionHybrid Recommender Systems: Survey and Experiments
3,764 Citations2002Robin Burke
This paper surveys the landscape of actual and possible hybrid recommenders, and introduces a novel hybrid, EntreeC, a system that combines knowledge-based recommendation and collaborative filtering to recommend restaurants, and shows that semantic ratings obtained from the knowledge- based part of the system enhance the effectiveness of collaborative filtering.
IEEE Transactions on Software EngineeringQoS-aware middleware for Web services composition
2,756 Citations2004Liangzhao Zeng, Boualem Benatallah +4 more
This paper presents a middleware platform which addresses the issue of selecting Web services for the purpose of their composition in a way that maximizes user satisfaction expressed as utility functions over QoS attributes, while satisfying the constraints set by the user and by the structure of the composite service.
ACM SIGIR ForumAn Algorithmic Framework for Performing Collaborative Filtering
2,552 Citations2017Jonathan L. Herlocker, Joseph A. Konstan +2 more
ACM Transactions on Information SystemsItem-based top-<i>N</i>recommendation algorithms
2,189 Citations2004Mukund Deshpande, George Karypis
This article presents one class of model-based recommendation algorithms that first determines the similarities between the various items and then uses them to identify the set of items to be recommended, and shows that these item-based algorithms are up to two orders of magnitude faster than the traditional user-neighborhood based recommender systems and provide recommendations with comparable or better quality.
An algorithmic framework for performing collaborative filtering
1,973 Citations1999Jonathan L. Herlocker, Joseph A. Konstan +2 more
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage.
arXiv (Cornell University)Empirical Analysis of Predictive Algorithms for Collaborative Filtering
1,507 Citations2013John S. Breese, David Heckerman +1 more
Several algorithms designed for collaborative filtering or recommender systems are described, including techniques based on correlation coefficients, vector-based similarity calculations, and statistical Bayesian methods, to compare the predictive accuracy of the various methods in a set of representative problem domains.
ACM Transactions on the WebEfficient algorithms for Web services selection with end-to-end QoS constraints
1,165 Citations2007Tao Yu, Yue Zhang +1 more
A broker-based architecture is designed to facilitate the selection of QoS-based services and efficient heuristic algorithms for service processes of different composition structures are presented.
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
835 Citations2006Jun Wang, Arjen P. de Vries +1 more
This paper re-formulates the memory-based collaborative filtering problem in a generative probabilistic framework, treating individual user-item ratings as predictors of missing ratings and shows that the proposed methods are indeed more robust against data sparsity and give better recommendations.
Personalized QoS Prediction forWeb Services via Collaborative Filtering
462 Citations2007Lingshuang Shao, Jing Zhang +4 more
Experimental results demonstrate that a collaborative filtering based approach to making similarity mining and prediction from consumers' experiences can make significant improvement on the effectiveness of QoS prediction for web services.
Effective missing data prediction for collaborative filtering
428 Citations2007Hao Ma, Irwin King +1 more
This paper uses the enhanced Pearson Correlation Coefficient (PCC) algorithm by adding one parameter which overcomes the potential decrease of accuracy when computing the similarity of users or items and proposes an effective missing data prediction algorithm, in which information of both users and items is taken into account.
Journal of Artificial Intelligence ResearchLearning to Order Things
313 Citations1999W. W. Cohen, R. E. Schapire +1 more
An on-line algorithm for learning preference functions that is based on Freund and Schapire's "Hedge" algorithm is considered, and it is shown that the problem of finding the ordering that agrees best with a learned preference function is NP-complete.
An automatic weighting scheme for collaborative filtering
292 Citations2004Rong Jin, Joyce Chai +1 more
An optimization algorithm to automatically compute the weights for different items based on their ratings from training users will create a clustered distribution for user vectors in the item space by bringing users of similar interests closer and separating users of different interests more distant.
CLOUD COMPUTING: AN OVERVIEW
260 Citations2009S. Nageswara Rao, V Nageswara +2 more
Collaborative reliability prediction of service-oriented systems
252 Citations2010Zibin Zheng, Michael R. Lyu
A collaborative reliability prediction approach, which employs the past failure data of other similar users to predict the Web service reliability for the current user, without requiring real-world Web service invocations, is proposed.
EigenRank
251 Citations2008Nathan N. Liu, Qiang Yang
This paper proposes a collaborative filtering approach that addresses the item ranking problem directly by modeling user preferences derived from the ratings and shows that the proposed approach outperforms traditional collaborative filtering algorithms significantly on the NDCG measure for evaluating ranked results.
Scenario-based reliability analysis of component-based software
185 Citations2003Sherif Yacoub, B. Cukic +1 more
A probabilistic model and a reliability analysis technique that is applicable to high-level designs that is used to identify critical components and critical component interfaces and to investigate the sensitivity of the application reliability to changes in the reliabilities of components and their interfaces are introduced.
QueueCloud Computing: An Overview
136 Citations2009Mache Creeger
This overview presents some of the key topics discussed during the ACM Cloud Computing and Virtualization CTO Roundtables of 2008 and summarizes the fundamental issues generally agreed upon by the panels and should help readers to assess the applicability of cloud computing to their application areas.
IEEE Transactions on Services ComputingProbabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations
128 Citations2008Sidney Rosario, Albert Benveniste +2 more
This paper proposes a statistical technique for run-time monitoring of soft contracts, which consist of a probability distribution for the considered QoS parameter and shows how to compose such contracts, to yield a global probabilistic contract for the orchestration.
Lecture notes in computer scienceA Modeling Approach to Analyze the Impact of Error Propagation on Reliability of Component-Based Systems
127 Citations2007Vittorio Cortellessa, Vincenzo Grassi
A novel approach to the analysis of the reliability of a component-based system that takes into account an important architectural attribute, namely the error propagation probability, which is the probability that an error, arising somewhere in the system, propagates to other components, possibly up to the system output.
On optimal service selection
120 Citations2005Piero A. Bonatti, Paola Festa
It is proved that one-time costs make the optimal selection problem computationally hard; in the absence of these costs the problem can be solved in polynomial time.
CARES
98 Citations2009Chenxing Yang, Baogang Wei +3 more
This paper presents a recommender system for CADAL digital library, namely CARES, which makes recommendations using a ranking-oriented collaborative filtering approach based on users' access logs, avoiding the problem of the lack of user ratings.
WS-DREAM: A distributed reliability assessment Mechanism for Web Services
90 Citations2008Zibin Zheng, Michael R. Lyu
This practical experience report presents a distribute reliability assessment mechanism for Web services (WS-DREAM), allowing users to carry out Web services reliability assessment in a collaborative manner, allowing users from five locations all over the world to perform reliability assessment to Web services distributed in six countries.
A QoS-aware fault tolerant middleware for dependable service composition
66 Citations2009Zibin Zheng, Michael R. Lyu
A QoS-aware fault tolerant middleware that includes a user-collaborated QoS model, various fault tolerance strategies, and a context-aware algorithm in determining optimal fault tolerance strategy for both stateless and stateful Web services is proposed.
A QoS-Aware Middleware for Fault Tolerant Web Services
24 Citations2008Zibin Zheng, Michael R. Lyu
A QoS-aware middleware for fault tolerant Web services so that service-oriented applications can dynamically adjust their optimal fault tolerance strategy to achieve good service reliability as well as good overall performance is proposed.