A Framework for Resource Allocation Strategies in Cloud Computing Environment

Cloud computing is an Internet-based computing and network model, which provides a market for sharing computing and storage resources. To motivate the cloud providers, the allocation of resources and their pricing becomes one of the challenges in this market. In this situation, designing auction-based mechanisms for cloud resource allocation have attracted a wide interest. Most of prior works focus on designing strategy-proof (a.k.a. truthful) cloud auction mechanisms to eliminate market manipulation. Strategy-proof auctions ensure that no bidders can improve their utilities by untruthful bidding. However, these strategy-proof auctions are fragile when false-name-bids are allowed. This is a new type of cheating where a bidder can gain profit by submitting bids using multiple fictitious names, and it is easy to form in cloud environment. Therefore, a new series of auction mechanisms are needed to guarantee the false-name-proofness. To tackle this issue, in this paper, we designed CACC, a combinatorial auction for resource allocation in Cloud Computing. To address the heterogeneity of cloud resource, the combinatorial auction model is adopted. We show CACC is both strategy-proof and false-name-proof. Moreover, CACC is computationally efficient. Through simulation experiments, we show that CACC is effective and efficient.

We consider a multi-channel cognitive radio network (CRN) where multiple secondary users share a single channel and multiple channels are simultaneously used by a single secondary user (SU) to satisfy their rate requirements. In this competitive CRN, our interest is in determining optimal power and rate distribution choices for each SU while maintaining fairness in of across all SUs. Unlike prior approaches that focus on resource allocation based on instantaneous quality of service (QoS), our approach to fairness encompasses both current and prior history of user experience with respect to QoS (collectively referred to as of experience). Specifically, we quantify user experience over time by introducing dynamic fairness weights for each SU in the resource allocation framework. The dynamics of the weights are governed by social behavioral models. In this paper, we study the effect of Homo Egualis (HE), Homo Parochius (HP) and Homo Reciprocan (HR) models. HE or HR based fairness weights in the resource allocation scheme result in a proportionate resource allocation with respect to users demand. Hence, with respect to unweighted allocation scheme (allocation scheme based on instantaneous QoS), the fairness weights in the resource allocation scheme cause some users to sacrifice resources and some users to gain resources to maintain a balance in allocated resources. HP based fairness weights show that collaboration among users through forming group result to achieve a proportionate resource allocation with respect to demand at least across the users of the collaborating group. Simulation results show that considering dynamic fairness weights in the resource allocation scheme provides a better system level fairness index (based on Jain fairness index (1)) relative to the unweighted allocation scheme.. Keywords-Competitive CRN; Quality of Experience; Fairness; Jain fairness index; Home Egualis; Homo Parochius; Homo Reciprocan.

In 5G networks, the deployment of network slices enabled by Software-Defined Networking (SDN) is becoming a critical component for delivering tailored services to meet diverse application needs. However, this introduces challenges in network management, particularly in efficiently allocating resources to ensure that each network slice meets its specific Quality of Service (QoS) and availability requirements. Simultaneously, it must optimize overall network performance and network operator’s profit, which is linked to the Quality of Experience (QoE) of the end-users. Existing works offer either an availability-based solution or a QoE-aware solution to this problem, but not both. This paper addresses the end-to-end network slice resource allocation problem by simultaneously considering QoS and availability requirements in slice placement, while employing a QoE-aware strategy for resource allocation. We propose a framework that optimizes the network operator profit i.e. the highest QoE with the least resource usage, and can be flexibly configured to model realistic scenarios. Arbitrary network slice requirements can be defined using slice-specific QoS/QoE mapping, resource requirements, end-to-end latency and availability. For solving the formulated problem a Mixed Integer Nonlinear Programming (MINLP) formulation and efficient heuristic methods are proposed. Our solution accounts for the non-linear QoS/QoE relationship, utilizes redundantly placed Service Function Chains (SFCs) to increase availability, and supports the sharing of Virtual Network Functions (VNFs) among SFCs to optimize resource usage. Through extensive simulations on realistic network topologies and slice requests, we demonstrate the framework’s effectiveness in offering flexible and efficient network slice placement and resource allocation, utilizing a baseline heuristic from related studies. The results indicate that while the exact method delivers an optimal solution, heuristic approaches are suitable for time-sensitive tasks, such as dynamic slice configuration.

The cloud provider plays a major role especially providing resources such as computing power for the cloud subscriber to deploy their applications on multiple platforms anywhere; anytime. Hence the cloud users still having problem for resource management in receiving the guaranteed computing resources on time. This will impact the service time and the service level agreements for various users in multiple applications. Therefore there is a need for a new resolution to resolve this problem. This survey paper conducts a study in resource allocation and monitoring in the cloud computing environment. We describe cloud computing and its properties, research issues in resource management mainly in resource allocation and monitoring and finally solutions approach for resource allocation and monitoring. It is believed that this paper would benefit both cloud users and researchers for further knowledge on resource management in cloud computing. On the other hand, the resources on the cloud are pooled in order to serve multiple subscribers. The provider use multi-tenancy model where the resources (physical and virtual) are reassigned dynamically based on the tenant requirement (5). The assigning of the resources will be based on the lease and SLA agreement, whereby different clients will need more or less amount of virtual resources. Subsequently, the growth of demands for cloud services is bringing more challenge for the provider to provide the resources to the client subscriber. Therefore, in this paper we provide a review on cloud computing which focus on resource management: allocation and monitoring. Our methodologies for this review are as follows:  We provide a cloud computing taxonomy covers the cloud definitions, characteristics and deployment models.  We then analyze the literatures and discuss about resource management, the process and the elements.  We then concentrate literatures on resource allocation and monitoring. We derived the problems, challenge and the approach solution for resource allocation and monitoring in the cloud. This paper organizes as follows: Section II introduces an overview of Cloud Computing, Section III discuss about resource management and its processes, Section IV discuss about related work with resource management in the cloud, section, Section V describes about approach solution to resource allocation and monitoring and, finally Section VI concludes the paper.

The applications that are being installed and run on the mobile devices need a platform of services offered on-demand and be reliable. These services are promised by cloud computing, where resource allocation plays a major role in providing the services and delivering the quality of service (QoS) to the cloud users. The task of provisioning the resources to the cloud users becomes challenging considering the proliferation in the number of users using the cloud on every day basis. The users in this context of proliferation can be considered as mobile nodes that need faster access to communicate among different devices and services. In this paper, the resource allocation on cloud is considered as a game between the clients or the users of the cloud submitting their tasks onto the cloud. Further, a utility maximisation approach as a game theoretic model for an efficient resource allocation in cloud computing is explored in this paper.

In this paper, we present a blockchain-based mobile edge computing (B-MEC) framework for adaptive resource allocation and computation offloading in future wireless networks, where the blockchain works as an overlaid system to provide management and control functions. In this framework, how to reach a consensus between the nodes while simultaneously guaranteeing the performance of both MEC and blockchain systems is a major challenge. Meanwhile, resource allocation, block size, and the number of consecutive blocks produced by each producer are critical to the performance of B-MEC. Therefore, an adaptive resource allocation and block generation scheme is proposed. To improve the throughput of the overlaid blockchain system and the quality of services (QoS) of the users in the underlaid MEC system, spectrum allocation, size of the blocks, and number of producing blocks for each producer are formulated as a joint optimization problem, where the time-varying wireless links and computation capacity of the MEC servers are considered. Since this problem is intractable using traditional methods, we resort to the deep reinforcement learning approach. Simulation results show the effectiveness of the proposed approach by comparing with other baseline methods.

Free to read on publisher's website Utilizing dynamic resource allocation for load balancing is considered as an important optimization process in cloud computing. In order to achieve maximum resource efficiency and scalability in a speedy manner this process is concerned with multiple objectives for an effective distribution of loads among virtual machines. In this realm,exploring new algorithms, as well as development of novel algorithms, is highly desired for technological advancement and continued progress in resource allocation application in cloud computing. Accordingly, this paper explores the application of two relatively new optimization algorithms and further proposes a hybrid algorithm for load balancing which can contribute well in maximizing the throughput of the cloud provider's network. The proposed algorithm is a hybrid of teaching-learning-based optimization algorithm (TLBO) and grey wolves optimization algorithm (GW). The hybrid algorithm performs more efficiently than utilizing every single one of these algorithms. Furthermore, it well balances the priorities and effectively considers load balancing based on time, cost, and avoidance of local optimum traps, which consequently leads to minimal amount of waiting time. To evaluate the effectiveness of the proposed algorithm, a comparison with the TLBO and GW algorithms is conducted and the experimental results are presented.

Organizations need to understand the importance of resource allocation and traffic forecasting for cloud computing more than ever because of the increasing demand for online services, data storage and remote work, which makes it challenging to estimate traffic and distribute resources. In cloud computing, there is still opportunity for increasing the model's forecast accuracy. The more accurate the traffic flow, the better the resource allocation. Therefore, this study investigate the adequate data analytic frameworks for managing cloud computing resource allocation in the organisation, According to the findings, six technique were used just for prediction, while one was utilized solely for resource allocation. In this sense, cloud computing resource allocation and prediction may be achieved by combining several techniques.this paper contributes the review to identify adequate data analytic frameworks for managing cloud computing resource allocation.

Cloud computing is internet-based computing era. The resources that are provided by cloud computing is easily accessible by the cloud clients when they are demanding. The infrastructure of cloud computing is dynamic in nature and resources are optimally allocated. These resources shared in cloud computing, like any other paradigm resource management is main issue in cloud computing. It is very challenging to provide all demanding resources, as the number of available shared-resources are increasing. This paper reviews sharing of resources (like servers, applications and data) over cloud and consider techniques to make adaptive algorithms for management of resources in cloud computing.

Priority in task scheduling and resource allocation for cloud computing has attracted significant attention from the research community. However, traditional scheduling algorithms often lack the ability to differentiate between tasks with varying levels of importance. This limitation presents a challenge when cloud servers must handle diverse tasks with distinct priority classes and strict quality of service requirements. To address these challenges in cloud computing environments, particularly within the infrastructure of service models, we propose a novel, self-adaptive, multiclass priority algorithm with VM clustering for resource allocation. This algorithm implements a four-tiered prioritization system to optimize key objectives, including makespan and energy consumption, while simultaneously optimizing resource utilization, degree of imbalance, and waiting time. Additionally, we propose a resource prioritization and load-balancing model based on the clustering technique. The proposed work was validated through multiple simulations using the CloudSim simulator, comparing its performance against well-known task scheduling algorithms. The simulation results and analysis demonstrate that the proposed algorithm effectively optimizes makespan and energy consumption. Specifically, our work achieved percentage improvements ranging from +0.97% to +26.80% in makespan and +3.68% to +49.49% in energy consumption while also improving other performance metrics, including throughput, resource utilization, and load balancing. This novel model demonstrably enhances task scheduling and resource allocation efficiency, particularly in complex scenarios with tight deadlines and multiclass priorities.

The crowd-creation space is a manifestation of the development of innovation theory to a certain stage. With the creation of the crowd-creation space, the problem of optimizing the resource allocation of the crowd-creation space has become a research hotspot. The emergence of cloud computing provides a new idea for solving the problem of resource allocation. Common cloud computing resource allocation algorithms include genetic algorithms, simulated annealing algorithms, and ant colony algorithms. These algorithms have their obvious shortcomings, which are not conducive to solving the problem of optimal resource allocation for crowd-creation space computing. Based on this, this paper proposes an In the cloud computing environment, the algorithm for optimizing resource allocation for crowd-creation space computing adopts a combination of genetic algorithm and ant colony algorithm and optimizes it by citing some mechanisms of simulated annealing algorithm. The algorithm in this paper is an improved genetic ant colony algorithm (HGAACO). In this paper, the feasibility of the algorithm is verified through experiments. The experimental results show that with 20 tasks, the ant colony algorithm task allocation time is 93ms, the genetic ant colony algorithm time is 90ms, and the improved algorithm task allocation time proposed in this paper is 74ms, obviously superior. The algorithm proposed in this paper has a certain reference value for solving the creative space computing optimization resource allocation.

Efficient spectrum and resource allocation remains a fundamental challenge in fifth generation (5G) wireless networks due to heterogeneous traffic requirements, spectrum scarcity, and dynamic interference conditions. Conventional scheduling and optimization techniques struggle to meet the stringent quality of service (QoS) demands of enhanced mobile broadband (eMBB), ultra-reliable low-latency communication (URLLC), and massive machine-type communication (mMTC). This paper presents an improved deep reinforcement learning (DRL)-based optimization framework for adaptive spectrum and resource allocation in 5G networks. The proposed model integrates Deep Q-Network (DQN), Double DQN (DDQN), and DDQN with Prioritized Experience Replay (PER) to enhance convergence speed, stability, and scalability. A realistic simulation environment combining ray-traced channel data and packet-level traffic modeling was developed to evaluate system performance. Results demonstrate that the proposed DRL framework achieves up to 7% throughput improvement over proportional fair scheduling, reduces average latency by 10–12%, and lowers URLLC violation rates by approximately 15% under high-interference and heterogeneous traffic scenarios. These findings confirm the feasibility of DRL as a practical and scalable solution for real-time 5G resource management.

Mobile cloud computing is growing rapidly because its device (i.e., smart phone) is becoming one of the main processing devices for users nowadays. Due to the limitation of resources such as battery life time, CPU and memory capacity, etc., a mobile device cannot satisfy some applications which usually demand more resources than it can afford. To alleviate this, the mobile device should collaborate with external resources to increase its capacity. In order to address these problems, we introduce a collaboration of thin-thick clients which enhances thin client capacities. We further propose a strategy to optimize the data distribution, especially big data in cloud computing. Moreover, we present an algorithm to allocate resources to meet service level agreement (SLA) and conduct simulations to evaluate our approach. Our results evaluation shows that our approach can improve resource allocation efficiency and has better performance than existing approaches.KeywordsCloud computingData distributionThinThick clientResource allocation

Cloud computing is essential for executing scientific workflows, offering scalable resources to process large volumes of data. However, efficient resource allocation remains a challenge due to fluctuations in demand and inadequate planning, which can increase makespan and thus energy consumption. In this context, infrastructure as a service is primarily used, allowing the rental of virtual machines with different characteristics. This study focuses on identifying the factors that influence the improvement of makespan for executing workflows from different disciplines and characteristics. The factors evaluated in this study are workfloF size, structure, and the number of virtual machines (VMs) required. The algorithms in this study consist of four heuristics and one metaheuristic, specifically a genetic algorithm (GA). Regarding the factors, the most relevant in CC is the number of VMs, where increasing the number of VMs reduces makespan to a certain extent, following the behavior described by the law of diminishing returns.

Cloud computing is a cutting-edge technology with enormous commercial and enterprise potential. Apps and related data can be accessed from any location thanks to clouds. Companies can drastically lower the cost of their infrastructure by renting resources from the cloud for storage and other processing needs. They can also use pay-as-you-go application access available to the entire firm. Therefore, obtaining licenses for specific products is not necessary. However, allocating resources as efficiently as possible is one of the main challenges in cloud computing. Because the model is unique, resource allocation is done to lower its expenses. Meeting application and customer requirements and consumer needs presents additional issues in resource allocation. This study provides a detailed discussion of several resource allocation systems, security threats, and the difficulties they face. This work is anticipated to help researchers and cloud users overcome obstacles.