scholarly journals Efficient Docker Container Scheduling using ABC Optimization Technique

In recent years the usage of virtualized technology is increasing rapidly. This makes enhancement in the performance efficiency leads to the need of the virtualization machine. This study is developed to enhance the performance level of the docker containers in cloud computing. The work presented in the paper considers the major parameters like availability, load, location, and energy of virtual machines to increase the system performance. The major objective of the work is to analyze and distribute the load of machines equally. The ABC (Artificial or Counterfeit Bee Colony) algorithm is used. For this purpose the ABC algorithm replaces the traditional ACO approach because of its various features such as simplicity, flexibility, and robustness. The output of the proposed work is evaluated in the terms of energy consumption and job completion. The observed values corresponding to these factors prove the proficiency of the suggested ABC algorithm based technique over traditional ACO algorithm based technique.

Author(s):  
Pooja Arora ◽  
Anurag Dixit

Purpose The advancements in the cloud computing has gained the attention of several researchers to provide on-demand network access to users with shared resources. Cloud computing is important a research direction that can provide platforms and softwares to clients using internet. However, handling huge number of tasks in cloud infrastructure is a complicated task. Thus, it needs a load balancing (LB) method for allocating tasks to virtual machines (VMs) without influencing system performance. This paper aims to develop a technique for LB in cloud using optimization algorithms. Design/methodology/approach This paper proposes a hybrid optimization technique, named elephant herding-based grey wolf optimizer (EHGWO), in the cloud computing model for LB by determining the optimal VMs for executing the reallocated tasks. The proposed EHGWO is derived by incorporating elephant herding optimization (EHO) in grey wolf optimizer (GWO) such that the tasks are allocated to the VM by eliminating the tasks from overloaded VM by maintaining the system performance. Here, the load of physical machine (PM), capacity and load of VM is computed for deciding whether the LB has to be done or not. Moreover, two pick factors, namely, task pick factor (TPF) and VM pick factor (VPF), are considered for choosing the tasks for reallocating them from overloaded VM to underloaded VM. The proposed EHGWO decides the task to be allocated in the VM based on the newly derived fitness functions. Findings The minimum load and makespan obtained in the existing methods, constraint measure based LB (CMLB), fractional dragonfly based LB algorithm (FDLA), EHO, GWO and proposed EHGWO for the maximum number of VMs is illustrated. The proposed EHGWO attained minimum makespan with value 814,264 ns and minimum load with value 0.0221, respectively. Meanwhile, the makespan values attained by existing CMLB, FDLA, EHO, GWO, are 318,6896 ns, 230,9140 ns, 1,804,851 ns and 1,073,863 ns, respectively. The minimum load values computed by existing methods, CMLB, FDLA, EHO, GWO, are 0.0587, 0.026, 0.0248 and 0.0234. On the other hand, the proposed EHGWO with minimum load value is 0.0221. Hence, the proposed EHGWO attains maximum performance as compared to the existing technique. Originality/value This paper illustrates the proposed LB algorithm using EHGWO in a cloud computing model using two pitch factors, named TPF and VPF. For initiating LB, the tasks assigned to the overloaded VM are reallocated to under loaded VMs. Here, the proposed LB algorithm adapts capacity and loads for the reallocation. Based on TPF and VPF, the tasks are reallocated from VMs using the proposed EHGWO. The proposed EHGWO is developed by integrating EHO and GWO algorithm using a new fitness function formulated by load of VM, migration cost, load of VM, capacity of VM and makespan. The proposed EHGWO is analyzed based on load and makespan.


Author(s):  
Gurpreet Singh ◽  
Manish Mahajan ◽  
Rajni Mohana

BACKGROUND: Cloud computing is considered as an on-demand service resource with the applications towards data center on pay per user basis. For allocating the resources appropriately for the satisfaction of user needs, an effective and reliable resource allocation method is required. Because of the enhanced user demand, the allocation of resources has now considered as a complex and challenging task when a physical machine is overloaded, Virtual Machines share its load by utilizing the physical machine resources. Previous studies lack in energy consumption and time management while keeping the Virtual Machine at the different server in turned on state. AIM AND OBJECTIVE: The main aim of this research work is to propose an effective resource allocation scheme for allocating the Virtual Machine from an ad hoc sub server with Virtual Machines. EXECUTION MODEL: The execution of the research has been carried out into two sections, initially, the location of Virtual Machines and Physical Machine with the server has been taken place and subsequently, the cross-validation of allocation is addressed. For the sorting of Virtual Machines, Modified Best Fit Decreasing algorithm is used and Multi-Machine Job Scheduling is used while the placement process of jobs to an appropriate host. Artificial Neural Network as a classifier, has allocated jobs to the hosts. Measures, viz. Service Level Agreement violation and energy consumption are considered and fruitful results have been obtained with a 37.7 of reduction in energy consumption and 15% improvement in Service Level Agreement violation.


2014 ◽  
Vol 1046 ◽  
pp. 508-511
Author(s):  
Jian Rong Zhu ◽  
Yi Zhuang ◽  
Jing Li ◽  
Wei Zhu

How to reduce energy consumption while improving utility of datacenter is one of the key technologies in the cloud computing environment. In this paper, we use energy consumption and utility of data center as objective functions to set up a virtual machine scheduling model based on multi-objective optimization VMSA-MOP, and design a virtual machine scheduling algorithm based on NSGA-2 to solve the model. Experimental results show that compared with other virtual machine scheduling algorithms, our algorithm can obtain relatively optimal scheduling results.


2018 ◽  
Vol 6 (5) ◽  
pp. 340-345
Author(s):  
Rajat Pugaliya ◽  
Madhu B R

Cloud Computing is an emerging field in the IT industry. Cloud computing provides computing services over the Internet. Cloud Computing demand increasing drastically, which has enforced cloud service provider to ensure proper resource utilization with less cost and less energy consumption. In recent time various consolidation problems found in cloud computing like the task, VM, and server consolidation. These consolidation problems become challenging for resource utilization in cloud computing. We found in the literature review that there is a high level of coupling in resource utilization, cost, and energy consumption. The main challenge for cloud service provider is to maximize the resource utilization, reduce the cost and minimize the energy consumption. The dynamic task consolidation of virtual machines can be a way to solve the problem. This paper presents the comparative study of various task consolidation algorithms.


2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono

Artificial Bee Colony (ABC) algorithm is one of metaheuristic optimization technique based on population. This algorithm mimicking honey bee swarm to find the best food source. ABC algorithm consist of four phases: initialization phase, employed bee phase, onlooker bee phase and scout bee phase. This study modify the onlooker bee phase in selection process to find the neighborhood food source. Not all food sources obtained are randomly sought the neighborhood as in ABC algorithm. Food sources are selected by comparing their objective function values. The food sources that have value lower than average value in that iteration will be chosen by onlooker bee to get the better food source. In this study the modification of this algorithm is called New Modification of Artificial Bee Colony Algorithm (MB-ABC). MB-ABC was applied to 4 Benchmark functions. The results show that MB-ABC algorithm better than ABC algorithm


2021 ◽  
Vol 12 (3) ◽  
pp. 16-38
Author(s):  
Pushpa R. ◽  
M. Siddappa

In this paper, VM replacement strategy is developed using the optimization algorithm, namely artificial bee chicken swarm optimization (ABCSO), in cloud computing model. The ABCSO algorithm is the integration of the artificial bee colony (ABC) in chicken swarm optimization (CSO). This method employed VM placement based on the requirement of the VM for the completion of the particular task using the service provider. Initially, the cloud system is designed, and the proposed ABCSO-based VM placement approach is employed for handling the factors, such as load, CPU usage, memory, and power by moving the virtual machines optimally. The best VM migration strategy is determined using the fitness function by considering the factors, like migration cost, load, and power consumption. The proposed ABCSO method achieved a minimal load of 0.1688, minimal power consumption of 0.0419, and minimal migration cost of 0.0567, respectively.


2018 ◽  
Vol 7 (1.7) ◽  
pp. 189
Author(s):  
G Soniya Priyatharsini ◽  
N Malarvizhi

In the tremendous growth of the cloud computing, server consolidation plays a vital role. It gives more benefits also it gives the pollution towards the nature. Inspite of avoiding this, saving of energy in the data center or the cluster is more important. In this regard this paper proposes a method of which reduces the energy consumption. This is done by identifying the active physical machines and the remaining machines were kept in the sleep or off mode according to the user’s availability. Here Virtual Machines (VMs) are grouped under the particular types. Based on this type the customer’s resource request can be maintained.


Author(s):  
Adib Habbal ◽  
Siti Aminah Abdullah ◽  
Emmanuel O.C. Mkpojiogu ◽  
Suhaidi Hassan ◽  
Nabil Benamar

Cloud computing has attracted the attention of educational and research institutions as a way to support modern trends in teaching and learning. This article describes the performance assessment of a private cloud within a university environment using the Web of System Performance (WOSP) model. A survey was carried out to measure the respondents' attitude towards the use of private cloud in which students and experts serve as sample. Testing was conducted by designing a virtual lab consisting of a number of virtual machines operated by a selected sample. The results showed that the usage of cloud computing in university has good perceived system performance judging from how it fares in the constituent parts of the WOSP model. Furthermore, the study revealed that usability and flexibility outperformed criterion like security. Moreover, several non-functional criteria outperformed functionality. In short, the knowledge and results presented from assessing a private cloud using WOSP model could be beneficial for users, designers and managers of private clouds especially in universities.


2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Mustafa Tareq ◽  
Raed Alsaqour ◽  
Maha Abdelhaq ◽  
Mueen Uddin

A mobile ad hoc network (MANET) is a collection of mobile nodes that dynamically form a temporary network without using any existing network infrastructure. MANET selects a path with minimal number of intermediate nodes to reach the destination node. As the distance between each node increases, the quantity of transmission power increases. The power level of nodes affects the simplicity with which a route is constituted between a couple of nodes. This study utilizes the swarm intelligence technique through the artificial bee colony (ABC) algorithm to optimize the energy consumption in a dynamic source routing (DSR) protocol in MANET. The proposed algorithm is called bee DSR (BEEDSR). The ABC algorithm is used to identify the optimal path from the source to the destination to overcome energy problems. The performance of the BEEDSR algorithm is compared with DSR and bee-inspired protocols (BeeIP). The comparison was conducted based on average energy consumption, average throughput, average end-to-end delay, routing overhead, and packet delivery ratio performance metrics, varying the node speed and packet size. The BEEDSR algorithm is superior in performance than other protocols in terms of energy conservation and delay degradation relating to node speed and packet size.


Sign in / Sign up

Export Citation Format

Share Document