• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.2815-2839
• /
• 2020

In a cloud computing paradigm, allocation of various virtualized ICT resources is a complex problem due to the presence of heterogeneous application (MapReduce, content delivery and networks web applications) workloads having contentious allocation requirements in terms of ICT resource capacities (resource utilization, execution time, response time, etc.). This task of resource allocation becomes more challenging due to finite available resources and increasing consumer demands. Therefore, many unique models and techniques have been proposed to allocate resources efficiently. However, there is no published research available in this domain that clearly address this research problem and provides research taxonomy for classification of resource allocation techniques including strategic, target resources, optimization, scheduling and power. Hence, the main aim of this paper is to identify open challenges faced by the cloud service provider related to allocation of resource such as servers, storage and networks in cloud computing. More than 70 articles, between year 2007 and 2020, related to resource allocation in cloud computing have been shortlisted through a structured mechanism and are reviewed under clearly defined objectives. Lastly, the evolution of research in resource allocation techniques has also been discussed along with salient future directions in this area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5357-5381
• /
• 2018

Cloud computing offers a wide range of on-demand resources over the internet. Utility-based resource allocation in cloud data centers significantly increases the number of cloud users. Heavy usage of cloud data center encounters many problems such as sacrificing system performance, increasing operational cost and high-energy consumption. Therefore, the result of the system damages the environment extremely due to heavy carbon (CO2) emission. However, dynamic allocation of energy-efficient resources in cloud data centers overcomes these problems. In this paper, we have proposed Energy and Service Level Agreement (SLA) Aware Resource Allocation Heuristic Algorithms. These algorithms are essential for reducing power consumption and SLA violation without diminishing the performance and Quality-of-Service (QoS) in cloud data centers. Our proposed model is organized as follows: a) SLA violation detection model is used to prevent Virtual Machines (VMs) from overloaded and underloaded host usage; b) for reducing power consumption of VMs, we have introduced Enhanced minPower and maxUtilization (EMPMU) VM migration policy; and c) efficient utilization of cloud resources and VM placement are achieved using SLA-aware Modified Best Fit Decreasing (MBFD) algorithm. We have validated our test results using CloudSim toolkit 3.0.3. Finally, experimental results have shown better resource utilization, reduced energy consumption and SLA violation in heterogeneous dynamic cloud environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4197-4219
• /
• 2017

Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.

• 한국통신학회논문지
• /
• 제38B권7호
• /
• pp.512-518
• /
• 2013

분산 클라우드 컴퓨팅에서 자원 할당 알고리즘은 사용자 만족도와 서비스 수용 및 처리 능력과 밀접한 관련을 가지기 때문에 중요하다. 즉, 분산 클라우드에서는 서비스 처리를 위해 이용가능한 자원이 없을 때 발생하는 서비스 거부는 사용자 만족도를 반감시킨다. 따라서 본 논문에서는 서비스 거부를 최소화하기 위하여 데이터센터 자원 상황을 고려한 자원 할당 알고리즘을 제안한다. 제안하는 알고리즘은 Q-Learning 기반의 자원 할당량 학습에 의해서 클라우드 데이터센터에서 최대 자원 할당량 만큼 할당을 할 수 있으면 자원 할당량이 증가하고 그렇지 못할 때는 자원 할당량이 감소하게 된다. 본 논문에서는 제안하는 알고리즘과 기존의 두 알고리즘을 평가하고 제안하는 알고리즘이 두 알고리즘 보다 낮은 서비스 거부율을 보임을 증명한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2021년도 추계학술발표대회
• /
• pp.128-130
• /
• 2021

Smart cities collect data from thousands of IoT-based sensor devices for intelligent application-based services. Centralized cloud servers support application tasks with higher computation resources but introduce network latency. Fog layer-based data centers bring data processing at the edge, but fewer available computation resources and poor task allocation strategy prevent real-time data analysis. In this paper, tasks generated from devices are distributed as high resource and low resource intensity tasks. The novelty of this research lies in deploying a virtual node assigned to each cluster of IoT sensor machines serving a joint application. The node allocates tasks based on the task intensity to either cloud-computing or fog computing resources. The proposed Task Allocation Strategy provides seamless allocation of jobs based on process requirements.

• International Journal of Contents
• /
• 제8권4호
• /
• pp.7-11
• /
• 2012

Cloud Computing can be viewed as a dynamically-scalable pool of resources. Virtualization is one of the key technologies enabling Cloud Computing functionalities. Virtual machines (VMs) scheduling and allocation is essential in Cloud Computing environment. In this paper, two dynamic VMs scheduling and allocating schemes are presented and compared. One dynamically on-demand allocates VMs while the other deploys optimal threshold to control the scheduling and allocating of VMs. The aim is to dynamically allocate the virtual resources among the Cloud Computing applications based on their load changes to improve resource utilization and reduce the user usage cost. The schemes are implemented by using SimPy, and the simulation results show that the proposed adaptive scheme with one threshold can be effectively applied in a Cloud Computing environment both performance-wise and cost-wise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4320-4333
• /
• 2017

Energy-efficient virtual resource allocation algorithm has become a hot research topic in cloud computing. However, most of the existing allocation schemes cannot ensure each type of resource be fully utilized. To solve the problem, this paper proposes a virtual machine (VM) allocation algorithm on the basis of multi-dimensional resource, considering the diversity of user's requests. First, we analyze the usage of each dimension resource of physical machines (PMs) and build a D-dimensional resource state model. Second, we introduce an energy-resource state metric (PAR) and then propose an energy-aware multi-dimensional resource allocation algorithm called MRBEA to allocate resources according to the resource state and energy consumption of PMs. Third, we validate the effectiveness of the proposed algorithm by real-world datasets. Experimental results show that MRBEA has a better performance in terms of energy consumption, SLA violations and the number of VM migrations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1567-1587
• /
• 2014

Virtual Machine (VM) resource management is crucial to satisfy the Quality of Service (QoS) demands of various multimedia services in a media cloud platform. To this end, this paper presents a VM resource allocation model that dynamically and optimally utilizes VM resources to satisfy QoS requirements of media-rich cloud services or applications. It additionally maintains high system utilization by avoiding the over-provisioning of VM resources to services or applications. The objective is to 1) minimize the number of physical machines for cost reduction and energy saving; 2) control the processing delay of media services to improve response time; and 3) achieve load balancing or overall utilization of physical resources. The proposed VM allocation is mapped into the multidimensional bin-packing problem, which is NP-complete. To solve this problem, we have designed a Mixed Integer Linear Programming (MILP) model, as well as heuristics for quantitatively optimizing the VM allocation. The simulation results show that our scheme outperforms the existing VM allocation schemes in a media cloud environment, in terms of cost reduction, response time reduction and QoS guarantee.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5404-5424
• /
• 2018

This work is mainly focused on two major topics in cloud platforms by using OpenStack as a case study: management and provisioning of resources to meet the requirements of a service demanded by remote end-user and relocation of virtual machines (VMs) requests to offload the encumbered compute nodes. The general framework architecture contains two subsystems: 1) An orchestrator that allows to systematize provisioning and resource management in OpenStack, and 2) A resource utilization based subsystem for vibrant VM relocation in OpenStack. The suggested orchestrator provisions and manages resources by: 1) manipulating application program interfaces (APIs) delivered by the cloud supplier in order to allocate/control/manage storage and compute resources; 2) interrelating with software-defined networking (SDN) controller to acquire the details of the accessible resources, and training the variations/rules to manage the network based on the requirements of cloud service. For resource provisioning, an algorithm is suggested, which provisions resources on the basis of unused resources in a pool of VMs. A sub-system is suggested for VM relocation in a cloud computing platform. The framework decides the proposed overload recognition, VM allocation algorithms for VM relocation in clouds and VM selection.

• International Journal of Computer Science & Network Security
• /
• 제22권3호
• /
• pp.95-100
• /
• 2022

Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.