Multiobjective Dynamic Resource Allocation in Cloud Computing using Harris Hawk Optimization Algorithm (MDLB-HHO)

preprint OA: closed
Full text JSON View at publisher
Full text 7,389 characters · extracted from preprint-html · click to expand
Multiobjective Dynamic Resource Allocation in Cloud Computing using Harris Hawk Optimization Algorithm (MDLB-HHO) | 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. 7 March 2025 V1 Latest version Share on Multiobjective Dynamic Resource Allocation in Cloud Computing using Harris Hawk Optimization Algorithm (MDLB-HHO) Authors : C.M. Varun [email protected] and R.P. Anto Kumar Authors Info & Affiliations https://doi.org/10.22541/au.174134718.82491518/v1 162 views 99 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract Effective load balancing and resource distribution strategies are essential for optimizing performance and resource usage in cloud computing. Cloud computing necessitates flexible, dynamic load balancing and resource allocation among multiple goals. Load balancing and resource allocation in cloud computing are complex tasks. The primary goal of dynamic load balancing in cloud computing systems is to enhance resource usage and improve the efficiency of task allocation. The HHO algorithm is accountable for the dynamic allocation of tasks to virtual machines (VMs) according to the distribution of workload and usage of resources. Multiple experimental evaluations and comparisons with alternative load-balancing approaches have proved that the HHO algorithm successfully and efficiently manages dynamic load-balancing. These technological advancements have led to improved reaction times and enhanced resource efficiency. This approach offers a viable and efficient alternative for tackling load-balancing challenges in dynamic scenarios using the cooperative foraging behavior observed in hawks. The proposed approach accounts for the ever-changing demands of cloud applications and dynamically modifies the resource allocation technique. To accomplish this, a multiobjective fitness function is used to cut down on response time and overuse of resources while simultaneously improving resource efficiency. These findings suggest it may help make cloud-based services more efficient and sustainable. The Harris Hawks perform an extensive review of the solution space, wherein they identify the optimal approach for task allocation and adapt to the dynamic workload conditions by employing a process characterized by iterative interactions and positional updates. This approach uses hawks’ collaborative search behavior to dynamically assign tasks to VMs while accounting for load balancing and resource utilization. The proposed methodology can adapt to ever-changing workload demand situations. It employs a multiobjective fitness function to effectively improve key performance indicators such as response time, resource utilization, and efficiency. This work demonstrates how the HHO algorithm could improve the effectiveness and longevity of cloud-based services under changing conditions. Supplementary Material File (mdlb-hho-author.docx) Download 666.57 KB Information & Authors Information Version history V1 Version 1 07 March 2025 Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords cloud computing harris hawk optimization job scheduling load balancing Authors Affiliations C.M. Varun [email protected] RMK Engineering College View all articles by this author R.P. Anto Kumar St Xavier's Catholic College of Engineering View all articles by this author Metrics & Citations Metrics Article Usage 162 views 99 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation C.M. Varun, R.P. Anto Kumar. Multiobjective Dynamic Resource Allocation in Cloud Computing using Harris Hawk Optimization Algorithm (MDLB-HHO). Authorea . 07 March 2025. DOI: https://doi.org/10.22541/au.174134718.82491518/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')); }); 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.174134718.82491518/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:'9ff3b61d58c406f7',t:'MTc3OTM2Nzg3NA=='};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())}}}})();

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00