Dynamic resource allocation with otpimization techniques for qos in cloud computing
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2024.15.spl.06Keywords:
Cloud computing, quality of service, Optimization techniques, Dynamic resource allocation.Dimensions Badge
Issue
Section
License
Copyright (c) 2024 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Ensuring the quality of service (QoS) in cloud computing environments requires efficient resource allocation mechanisms to manage dynamic workloads and meet user demands. This paper proposes a dynamic resource allocation strategy that integrates gravitational search optimization (GSO) with Harris Hawks optimization (HHO) to optimize resource utilization and maintain QoS in cloud infrastructures. The proposed hybrid approach combines the global search capabilities of GSO, inspired by the law of gravity, with the exploitation and exploration strategies of HHO, mimicking the cooperative hunting behavior of Harris hawks. This synergy enables adaptive and efficient allocation of computational resources based on real-time workload fluctuations, reducing response times, minimizing energy consumption, and preventing Service Level Agreement (SLA) violations. By predicting workload variations and adjusting resource allocation dynamically, the proposed method ensures higher reliability, scalability, and cost-effectiveness compared to traditional resource allocation techniques. Simulation results demonstrate that the GSO-HHO-based approach outperforms conventional optimization algorithms in balancing the trade-offs between performance and resource efficiency, making it a robust solution for maintaining QoS in cloud computing environments.Abstract
How to Cite
Downloads
Similar Articles
- Ravikiran K, Neerav Nishant, M Sreedhar, N.Kavitha, Mathur N Kathiravan, Geetha A, Deep learning methods and integrated digital image processing techniques for detecting and evaluating wheat stripe rust disease , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- Kumari Neha, Amrita ., Quantum programming: Working with IBM’S qiskit tool , The Scientific Temper: Vol. 14 No. 01 (2023): The Scientific Temper
- S. Nagarani, Amalraj P., Lakshay Phor, Nishank S. Pimple, Banashree Sen, Ramaprasad Maiti, Vikas S. Jadhav, Innovative technological advancements in solving real quadratic equations: Pioneering the frontier of mathematical innovation , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Yasodha V, V. Sinthu Janita, AI-driven IoT routing: A hybrid deep reinforcement learning and shrike optimization framework for energy-efficient communication , The Scientific Temper: Vol. 16 No. 08 (2025): The Scientific Temper
- Raghvendra, Tulika Saxena, Saurabh Verma, Rashi Saxena, Smita Dron, Shilpi Singh, Combination of financial literacy, strategic marketing and effective human resource for sustainable household wealth development , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Suprabha Amit Kshatriya, Jaymin K Bhalani, Early detection of fire and smoke using motion estimation algorithms utilizing machine learning , The Scientific Temper: Vol. 15 No. 04 (2024): The Scientific Temper
- Parul Yadav, Priyanka Suryavanshi, Storage study on compositional analysis of quinoa and ragi based snacks , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- M. Menaha, J. Lavanya, Crop yield prediction in diverse environmental conditions using ensemble learning , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Elizabeth Mize, A critical analysis of the continuing professional development of teachers in India through the lens of NEP 2020 , The Scientific Temper: Vol. 16 No. 03 (2025): The Scientific Temper
- Abhishek Dwivedi, Nikhat Raza Khan, Reconfiguration of Automated Manufacturing Systems Using Gated Graph Neural Networks , The Scientific Temper: Vol. 13 No. 02 (2022): The Scientific Temper
<< < 5 6 7 8 9 10 11 12 13 14 > >>
You may also start an advanced similarity search for this article.

