TY - JOUR
AU - Walayat Hussain, Farookh Khadeer Hussain, Omar Khadeer Hussain, Elizabeth Chang
AB - Service level agreement (SLA) is an essential agreement formed between a consumer and a provider in business activities. The SLA defines the business terms, objectives, obligations and commitment of both parties to a business activity, and in cloud computing it also defines a consumer's request for both fixed and variable resources, due to the elastic and dynamic nature of the cloud-computing environment. Providers need to thoroughly analyze such variability when forming SLAs to ensure they commit to the agreements with consumers and at the same time make the best use of available resources and obtain maximum returns. They can achieve this by entering into viable SLAs with consumers. A consumer's profile becomes a key element in determining the consumer's reliability, as a consumer who has previous service violation history is more likely to violate future service agreements; hence, a provider can avoid forming SLAs with such consumers. In this paper, we propose a novel optimal SLA formation architecture from the provider's perspective, enabling the provider to consider a consumer's reliability in committing to the SLA. We classify existing consumers into three categories based on their reliability or trustworthiness value and use that knowledge to ascertain whether to accept a consumer request for resource allocation, and then to determine the extent of the allocation. Our proposed architecture helps the service provider to monitor the behavior of service consumers in the post-interaction time phase and to use that information to form viable SLAs in the pre-interaction time phase to minimize service violations and penalties. Key words cloud computing SLA monitoring viable SLA service level objectives © The British Computer Society 2016. All rights reserved. For Permissions, please email: journals.permissions@oup.com « Previous | Next Article » Table of Contents This Article The Computer Journal (2016) 59 (12): 1760-1783. doi: 10.1093/comjnl/bxw026 First published online: June 17, 2016 » Abstract Free Full Text (HTML) Free Full Text (PDF) Free All Versions of this Article: bxw026v1 59/12/1760 most recent Classifications Section A: Computer Science Theory, Methods and Tools Original Articles Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Google Scholar Articles by Hussain, W. Articles by Chang, E. Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue December 2016 59 (12) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 1.000 5-Yr impact factor: 1.041 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy 3hWaciBYRk30rSOQ7UOpP6viAxsZnEle true Looking for your next opportunity? Looking for jobs... Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read A Simplex Method for Function Minimization What is the Use of Operating Systems? Data Compression for a Source with Markov Characteristics Overview of Parallel Architectures for Databases Permutations by Interchanges » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis A new approach to variable metric algorithms A Rapidly Convergent Descent Method for Minimization Function minimization by conjugate gradients » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2016 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
TI - Provider-Based Optimized Personalized Viable SLA (OPV-SLA) Framework to Prevent SLA Violation
JF - The Computer Journal
DO - 10.1093/comjnl/bxw026
DA - 2016-12-01
UR - https://www.deepdyve.com/lp/oxford-university-press/provider-based-optimized-personalized-viable-sla-opv-sla-framework-to-20y1OrUjed
SP - 1760
VL - 59
IS - 12
DP - DeepDyve
ER -