Utility maximisation-based game theoretic approach for resource allocation in clouds

ALVEC: Auto-scaling by Lotka Volterra elastic cloud: A QoS aware non linear dynamical allocation model

With the advancement of information technology need to perform computing tasks everywhere and all the time there, in cloud computing environments and heterogeneous users have access to different sources with different characteristics that these resources are geographically in different areas. Due to this, the allocation of resources in cloud computing comes to the main issue is considered a major challenge to achieve high performance. Due to the nature of cloud computing is a distributed system to account, comes to business, economic methods such as auctions are used to allocate resources for decentralization. As an important economic bilateral hybrid auction model is the perfect solution for the allocation of resources in cloud computing, on the other hand, providers of cloud resources similarly, their sources of supply combined addressing. One of the problems auction two-way combination with maximum benefit for the parties to the transaction is the efficient allocation of resources to the problem of determining an auction winner is known. Given that the winning auction is NP-Hard. It results in a problem, several methods have been proposed to solve it. In this dissertation, taking into account the strength simulated annealing algorithm, a modified version of it is proposed for solving the winner determination in combinatorial double auction problem in cloud computing. The proposed approach is simulated along with genetic and simulated annealing algorithms and the results show that the proposed approach finds better solutions than the two mentioned algorithms.

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.

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 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.

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

Although cloud computing offers many benefits, such as flexibility, scalability, and profitability, some small and medium enterprises (SMEs) are still unable to fully utilize cloud resources, such as memory, computing power, storage, and network bandwidth. This reduces their productivity and increases their expenses. Therefore, the central objective of this paper was to examine the key challenges related to the allocation of cloud computing resources in small and medium enterprises. The method used for this study is based upon qualitative research using 12 interviews with 12 owners, managers, and experts in cloud computing in four countries: the United States of America, the United Kingdom, India, and Pakistan. Our results, based on our empirical data, show 11 key barriers to resource allocation in cloud computing that are classified based on the technology, organization, and environment (TOE) framework. Theoretically, this research contributes to the body of knowledge concerning cloud computing technology and offers valuable understanding of the cloud computing resource allocation approaches employed by small and medium enterprises (SMEs). In practice, this research is useful to aid SMEs in implementing successful and sustainable strategies for allocating cloud computing resources.

Cloud computing allows execution and deployment of different types of applications such as interactive databases or web-based services which require distinctive types of resources. These applications lease cloud resources for a considerably long period and usually occupy various resources to maintain a high quality of service (QoS) factor. On the other hand, general big data batch processing workloads are less QoS-sensitive and require massively parallel cloud resources for short period. Despite the elasticity feature of cloud computing, fine-scale characteristics of cloud-based applications may cause temporal low resource utilization in the cloud computing systems, while process-intensive highly utilized workload suffers from performance issues. Therefore, ability of utilization efficient scheduling of heterogeneous workload is one challenging issue for cloud owners. In this paper, addressing the heterogeneity issue impact on low utilization of cloud computing system, conjunct resource allocation scheme of cloud applications and processing jobs is presented to enhance the cloud utilization. The main idea behind this paper is to apply processing jobs and cloud applications jointly in a preemptive way. However, utilization efficient resource allocation requires exact modeling of workloads. So, first, a novel methodology to model the processing jobs and other cloud applications is proposed. Such jobs are modeled as a collection of parallel and sequential tasks in a Markovian process. This enables us to analyze and calculate the efficient resources required to serve the tasks. The next step makes use of the proposed model to develop a preemptive scheduling algorithm for the processing jobs in order to improve resource utilization and its associated costs in the cloud computing system. Accordingly, a preemption-based resource allocation architecture is proposed to effectively and efficiently utilize the idle reserved resources for the processing jobs in the cloud paradigms. Then, performance metrics such as service time for the processing jobs are investigated. The accuracy of the proposed analytical model and scheduling analysis is verified through simulations and experimental results. The simulation and experimental results also shed light on the achievable QoS level for the preemptively allocated processing jobs.

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.

Group technology-based model and cuckoo optimization algorithm for resource allocation in cloud computing

Cloud computing(CC) delivers multiple services to users by processing complex tasks through internet connections to serve as a dynamic, dependable, and flexible computing solution. With the increased Internet speed, the user demands to perform many tasks through computing provided by cloud virtual machines (VMs) created in heterogeneous servers. The complexity of cloud computing(CC) increases through the diversity of servers and the increased demand for resources to perform more tasks, which makes the cloud data center(CDC) unbalanced in load. Therefore, future cloud systems will require more effective resource management(RM) methods to balance load and improve Quality of Service (QoS). This paper proposes KMPPVM-DRM, a dynamic clustering and scheduling approach for VM resource allocation(RA) based on the KMeans++ algorithm. VMs are clustered into three groups (high, medium, low) according to their real-time normalized CPU and RAM weights, using weighting parameters α = 0.6 and β = 0.4. Tasks are categorized into three levels based on length and mapped to appropriate VM clusters. Within each cluster, a Utilization-Level Comparator (ULC) dynamically selects the optimal VM for task execution. The experimental results were conducted using CloudSim, with 5 and 10 VMs and task counts ranging from 1000 to 10000. The proposed model was compared with PSO, ACO, and DBSCAN algorithms using execution time, average start time, and average finish time. Results show that with 10 VMs, the proposed model achieved a harmonic mean execution time of 886.72 ms, compared to 4102.99 ms (PSO), 4672.25 ms (ACO), and 3071.51 ms (DBSCAN). It also attained the lowest harmonic mean start and finish times of 166.41 ms and 167.19 ms, respectively. Relative reduction in execution time against DBSCAN ranged from 69.90% to 71.52%, with start and finish time improvements between 52.65% and 81.51%.To ensure statistical reliability, a paired t-test confirmed that the performance improvements were statistically significant (p < 0.05) across all task sizes. The findings confirm that KMPPVM-DRM enhances resource allocation(RA) efficiency and scheduling effectiveness, maintaining balanced loads even with limited resources (e.g., only 5 VMs) and outperforming PSO, ACO, and DBSCAN in all tested scenarios.

Efficient and intelligent resource allocation remains a fundamental challenge in cloud computing due to the dynamic, heterogeneous, and high-dimensional nature of cloud environments. This chapter presents an adaptive hybrid optimization framework that integrates Swarm Intelligence (SI) algorithms with Deep Q Learning (DQL) to address the complexity of real-time decision-making in large-scale cloud systems. The proposed architecture leverages the global exploration capabilities of swarm-based models and the policy-learning strengths of reinforcement learning to enable adaptive and SLA-aware resource management. By combining collective search behavior with neural network-driven policy refinement, the hybrid system dynamically allocates computational resources, minimizes latency, and optimizes long-term performance under varying workload conditions. Extensive analysis demonstrates that the model efficiently navigates high-dimensional state spaces, balances exploration and exploitation, and improves convergence speed while reducing SLA violations. The chapter also includes complexity analysis and performance evaluations, confirming the scalability and responsiveness of the hybrid framework in distributed cloud infrastructures. This work contributes to the development of nextgeneration autonomous systems for cloud optimization by bridging bio-inspired computation and deep learning.

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.

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.

Sun, G.; Chen, H., and Mao, Y., 2020. The efficiency analysis model of technological innovation resource allocation of coastal enterprises based on genetic algorithm. In: Yang, Y.; Mi, C.; Zhao, L., and Lam, S. (eds.), Global Topics and New Trends in Coastal Research: Port, Coastal and Ocean Engineering. Journal of Coastal Research, Special Issue No. 103, pp. 691–695. Coconut Creek (Florida), ISSN 0749-0208.With the continuous development of marine technology, the tasks of marine survey, exploration, navigation, transportation and development are becoming more and more serious. It is necessary to pay attention to the problem of planning resource allocation in coastal areas, so as to design a more reasonable resource allocation scheme. The traditional analysis model can only converge locally, resulting in the deviation of the analysis results of resource allocation efficiency. Therefore, the construction method of the efficiency analysis model of technological innovation resource allocation of coastal enterprises based on genetic algorithm is proposed. According to the relationship between fuzzy operator and fuzzy scale, this method calculates the carrying capacity of coastal environmental resources. In light of the prediction results of the dynamic demand forecast function of emergency resources, it sets the evaluation weight of the efficiency of technological innovation resource allocation of coastal enterprises. Based on the global convergence characteristics of genetic algorithm, it realizes the construction of the efficiency analysis model of technological innovation resource allocation of coastal enterprises. The experimental results show that compared with the traditional method, the model based on genetic algorithm has stronger convergence and can achieve global data convergence. It can be seen that the analysis results of this model accord with the reality and can be applied to the analysis of resource allocation efficiency at this stage.