首页 | 本学科首页   官方微博 | 高级检索  
     


A computational model for ranking cloud service providers using hypergraph based techniques
Affiliation:1. Centre for Information Super Highway (CISH), School of Computing, SASTRA University, Thanjavur, Tamil Nadu, India;2. Discrete Mathematics Research Laboratory (DMRL), Department of Mathematics, SASTRA University, Thanjavur, Tamil Nadu, India;1. Department of Computer Science, Electrical Engineering and Mathematical Sciences, Western Norway University of Applied Sciences, Bergen, Norway;2. Department of Mathematics and Computer Science, Brandon University, Brandon, Canada;3. Research Centre for Interneural Computing, China Medical University, Taichung, Taiwan;1. Department of Radiology and Biomedical Research Imaging Center, University of North Carolina at Chapel Hill, NC, USA;2. Department of Brain and Cognitive Engineering, Korea University, Seoul, Korea
Abstract:In a cloud marketplace, the existence of wide range of Cloud Service Providers (CSPs) makes it hard for the Cloud Users (CUs) to find an appropriate CSP based on their requirements. The design of a suitable service selection framework helps the users in the selection of a suitable CSP, while motivating the CSPs to satisfy the assured Service Level Agreement (SLA) and enhance the Quality of Service (QoS). Existing service selection models employ random assignment of weights to the QoS attributes, replacement of missing data by random values, etc. which results in an inaccurate ranking of the CSPs. Moreover, these models have high computational overhead. In this study, a novel cloud service selection architecture, Hypergraph based Computational Model (HGCM) and Minimum Distance-Helly Property (MDHP) algorithm have been proposed for ranking the cloud service providers. Helly property of the hypergraph had been used to assign weights to the attributes and reduce the complexity of the ranking model, while arithmetic residue and Expectation–Maximization (EM) algorithms were used to impute missing values. Experimental results provided by MDHP under different case studies (dataset used by various research communities and synthetic dataset) confirms the ranking algorithm to be scalable and computationally attractive.
Keywords:Cloud service ranking  Hypergraph  Helly property  Minimum distance algorithm  Service Measurement Index (SMI)
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号