Rough set based quality of service design for service provisioning in clouds

Authors:
Praveen Ganghishetti;Rajeev Wankar;Rafah M. Almuttairi;C. Raghavendra Rao
Affiliations:
Grid Computing Labaratory, Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Grid Computing Labaratory, Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Grid Computing Labaratory, Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Grid Computing Labaratory, Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 3
Cited 0

The Eucalyptus Open-Source Cloud-Computing System

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Quick complete attribute reduction algorithm

FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 4
Adapting market-oriented scheduling policies for cloud computing

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quality of Service (QoS) is a broad term used to describe the overall experience a user or application will receive over a network. A rough set based approach is used to design a modified Cloud-QoS Management Strategy (MC-QoSMS). MC-QoSMS is a component of cloud broker that is used to allocate resources based on Service Level Agreement between users and providers for Infrastructure as a Service (IaaS) provisioning of cloud. Concept of reduct from rough set theory is used to allocate the best service provider to the cloud's user with minimum searching time. The performance of the proposed system has been analyzed in terms of number of requests. It is reported that the system outperformed random algorithm by 25% and the round robin algorithm by 30% for 100 requests.