A Survey on Dynamic SLAs for Fog Computing

A Survey on Dynamic SLAs for Fog Computing | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 29 May 2025 V1 Latest version Share on A Survey on Dynamic SLAs for Fog Computing Authors : Amaury Sauret 0009-0002-3853-1184 [email protected] , Christophe Cérin , Gladys Diaz , Jonathan Rivalan , Tarek Menouer , and Khaled Boussetta Authors Info & Affiliations https://doi.org/10.22541/au.174855437.71710419/v1 Published Software: Practice and Experience Version of record Peer review timeline 361 views 230 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract The concept of a Service Level Agreement (SLA), a contractual arrangement between providers and customers, is firmly established in the software engineering field. However, introducing enhanced dynamism to this service contract, in one or more directions to be subsequently specified, constitutes a challenge, an important step for the Computer Engineering community, and, in our case, an anticipated contribution to the fogSLAAntillas (fogSLA) collaborative project. Consequently, this paper seeks to improve the understanding, classification, and articulation of various terminologies associated with dynamic SLAs as they have evolved in the literature. The discussion extends to methodological and practical options for integrating this concept within the fogSLA project framework. On this occasion, we share our experience with dynamic SLA in the context of scheduling pods for a Kubernetes cluster. This survey commences with a literature review and subsequently explores potential research directions applicable to the fogSLA project and to the broader Cloud, Fog, and Edge Computing communities. Some of these paths are already well defined but would require community endorsement to attain the status of standards in the future. Therefore, we propose novel ideas and extend beyond a mere survey of the existing literature. Supplementary Material File (survey_fogsla.pdf) Download 240.10 KB Information & Authors Information Version history V1 Version 1 29 May 2025 Peer review timeline Published Software: Practice and Experience Version of Record 23 Feb 2026 Published Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords industrial collaborative project on fog computing innovative sla approaches for cloud/fog/edge computing and virtualized systems service-oriented and open-source software development Authors Affiliations Amaury Sauret 0009-0002-3853-1184 [email protected] Universite Sorbonne Paris Nord Institut Galilee View all articles by this author Christophe Cérin Universite Sorbonne Paris Nord Institut Galilee View all articles by this author Gladys Diaz Universite Sorbonne Paris Nord Institut Galilee View all articles by this author Jonathan Rivalan SMILE View all articles by this author Tarek Menouer CGI View all articles by this author Khaled Boussetta Universite Sorbonne Paris Nord Institut Galilee View all articles by this author Metrics & Citations Metrics Article Usage 361 views 230 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Amaury Sauret, Christophe Cérin, Gladys Diaz, et al. A Survey on Dynamic SLAs for Fog Computing. Authorea . 29 May 2025. DOI: https://doi.org/10.22541/au.174855437.71710419/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); Cited by Bhargavi K, Sajjan G. Shiva, Tiny Language Model Guided Flow Q Learning for Optimal Task Scheduling in Fog Computing, Algorithms, 19 , 1, (60), (2026). https://doi.org/10.3390/a19010060 Crossref Sidi Mohammed Kaddour, Baptiste Jonglez, Daniel Balouek, Application level observability for adaptive Edge to Cloud continuum systems, Proceedings of the 18th IEEE/ACM International Conference on Utility and Cloud Computing, (1-6), (2025). https://doi.org/10.1145/3773274.3774855 Crossref Loading... View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.174855437.71710419/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9fe9a397dfc63fe2',t:'MTc3OTI2MjI1Nw=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();