Design a Hierarchical Resource Allocating Approach by Using Dual Q-Learning in Deep Reinforcement Algorithm

With the advent of the Internet of Things (IoT), the number of devices that work in these environments has greatly increased, which has caused major changes in the structure of data processing and information storage. In this regard, cloud computing is an Internet-based computing platform that provides the necessary processing resources for users. However, due to the ever-increasing volume, speed and communication technologies, the current model of cloud processing can hardly provide satisfactory performance quality. So, proper management of the incoming requests is very critical for the continuous operation. In this project, in order to increase the speed of resource allocation operation, virtual machines are ranked by game theory, which significantly reduces the time and computational complexity of the whole process. The combination of these three approaches and their integration in sequence increases the speed of allocation performance and reduces the costs associated with it. In this article, two characteristics of activity completion time and service quality have been evaluated. According to the obtained results, applying the proposed structure on the Borg dataset provided by Google has yielded results in the range of more than 35% for reduction in CPU usage cost compared to other existing methods.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-05-02
DOI
https://doi.org/10.5281/zenodo.15321690
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design a Hierarchical Resource Allocating Approach by Using Dual Q-Learning in Deep Reinforcement Algorithm

Zenodo (CERN European Organization for Nuclear Research)
Cloud Computing and Resource Management
article

Design a Hierarchical Resource Allocating Approach by Using Dual Q-Learning in Deep Reinforcement Algorithm

article en

Abstract

With the advent of the Internet of Things (IoT), the number of devices that work in these environments has greatly increased, which has caused major changes in the structure of data processing and information storage. In this regard, cloud computing is an Internet-based computing platform that provides the necessary processing resources for users. However, due to the ever-increasing volume, speed and communication technologies, the current model of cloud processing can hardly provide satisfactory performance quality. So, proper management of the incoming requests is very critical for the continuous operation. In this project, in order to increase the speed of resource allocation operation, virtual machines are ranked by game theory, which significantly reduces the time and computational complexity of the whole process. The combination of these three approaches and their integration in sequence increases the speed of allocation performance and reduces the costs associated with it. In this article, two characteristics of activity completion time and service quality have been evaluated. According to the obtained results, applying the proposed structure on the Borg dataset provided by Google has yielded results in the range of more than 35% for reduction in CPU usage cost compared to other existing methods.

Zenodo (CERN European Organization for Nuclear Research)
University of Neyshabur (IR), Islamic Azad University of Nishapur (IR)
Decent work and economic growth
Openalex Percentile: Top 38%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.