scholarly journals Enhancement of Security and Energy Efficiency in Cloud Computing

2019 ◽  
Vol 8 (2) ◽  
pp. 2459-2462

This paper focuses on the job scheduling in cloud environment. Here the task has been scheduled in cloud and fog. Cloud provides services to heavy application while fog provides service to lighter application. The job scheduler would be helpful to reduce burden of cloud and help in energy optimization. The jobs are scheduled according to their types and priority. Various job scheduling algorithm such as gang scheduling, FCFS and round robin mechanism have been discussed in this research for load balancing and improve the compilation time. The simulation has been made using Matlab on virtual machines.

Author(s):  
K. Balaji, Et. al.

The evolution of IT led Cloud computing technology emerge as a new prototype in providing the services to its users on rented basis at any time or place. Considering the flexibility of cloud services, innumerable organizations switched their businesses to the cloud technology by setting up more data centers. Nevertheless, it has become mandatory to provide profitable execution of tasks and appropriate  resource utilization. A few approaches were outlined in literature to enhance performance, job scheduling, storage resources, QoS and load distribution. Load balancing concept permits data centers to avert over-loading or under-loading in virtual machines that as such is an issue in cloud computing domain. Consequently, it necessitate the researchers to layout and apply a proper load balancer for cloud environment. The respective study represents a view of problems and threats faced by the current load balancing techniques and make the researchers find more efficient algorithms.


Author(s):  
K. Balaji , Et. al.

The evolution of IT led Cloud computing technology emerge as a new prototype in providing the services to its users on rented basis at any time or place. Considering the flexibility of cloud services, innumerable organizations switched their businesses to the cloud technology by setting up more data centers. Nevertheless, it has become mandatory to provide profitable execution of tasks and appropriate  resource utilization. A few approaches were outlined in literature to enhance performance, job scheduling, storage resources, QoS and load distribution. Load balancing concept permits data centers to avert over-loading or under-loading in virtual machines that as such is an issue in cloud computing domain. Consequently, it necessitate the researchers to layout and apply a proper load balancer for cloud environment. The respective study represents a view of problems and threats faced by the current load balancing techniques and make the researchers find more efficient algorithms.


2016 ◽  
Vol 15 (14) ◽  
pp. 7435-7443 ◽  
Author(s):  
Sheenam Kamboj ◽  
Mr. Navtej Singh Ghumman

Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results. 


2018 ◽  
Vol 7 (2.19) ◽  
pp. 70
Author(s):  
Aswini J ◽  
N Malarvizhi ◽  
Anitha. K ◽  
. .

Cloud computing helps to share data and provide many resources to users. Users pay only for those resources as much they used. Rapid increase in load to these cloud framework cannot be predicted. Load balancing is one of the issues in cloud computing that distributes the workload to the nodes in such a way no node is overloaded or under - loaded. Load balancing is a main challenge in cloud environment.  In this work,  scheduling algorithm is applied for load balancing by considering the cost of  task execution and make span. This scheduling algorithm efficiently maps task to available nodes in cloud and it is beneficial to user and service provider. Load balancing segregates assignments of tasks among all available virtual machines from datacenters. Assignment of tasks to virtual machines can be done with minimum delay. To enhance the make span, resource utilization, our proposed framework utilizes AFSS-SHC load balancing strategy.  A metaheuristics swarm intelligence algorithm which is NP-hard have been suggested to balance load across devices. The algorithms taken into account are-HEFT,PSO and PSO-HC. The proposed methodology AFSS-SHC optimized the task scheduling. Random tasks have been taken for this purpose and simulated to show that the proposed methodology works efficiently to reduce the make span of tasks to reduce the cost.  


2017 ◽  
Vol 16 (6) ◽  
pp. 6953-6961
Author(s):  
Kavita Redishettywar ◽  
Prof. Rafik Juber Thekiya

Cloud computing is a vigorous technology by which a user can get software, application, operating system and hardware as a service without actually possessing it and paying only according to the usage. Cloud Computing is a hot topic of research for the researchers these days. With the rapid growth of Interne technology cloud computing have become main source of computing for small as well big IT companies. In the cloud computing milieu the cloud data centers and the users of the cloud-computing are globally situated, therefore it is a big challenge for cloud data centers to efficiently handle the requests which are coming from millions of users and service them in an efficient manner. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.


Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


2021 ◽  
Author(s):  
Marta Chinnici ◽  
Asif Iqbal ◽  
ah lian kor ◽  
colin pattinson ◽  
eric rondeau

Abstract Cloud computing has seen rapid growth and environments are now providing multiple physical servers with several virtual machines running on those servers. Networks have grown larger and have become more powerful in recent years. A vital problem related to this advancement is that it has become increasingly complex to manage networks. SNMP is one standard which is applied as a solution to this management of networks problem. This work utilizes SNMP to explore the capabilities of SNMP protocol and its features for monitoring, control and automation of virtual machines and hypervisors. For this target, a stage-wise solution has been formed that obtains results of experiments from the first stage uses SNMPv3 and feed to the second stage for further processing and advancement. The target of the controlling experiments is to explore the extent of SNMP capability in the control of virtual machines running in a hypervisor, also in terms of energy efficiency. The core contribution based on real experiments is conducted to provide empirical evidence for the relation between power consumption and virtual machines.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahfooz Alam ◽  
Mahak ◽  
Raza Abbas Haidri ◽  
Dileep Kumar Yadav

Purpose Cloud users can access services at anytime from anywhere in the world. On average, Google now processes more than 40,000 searches every second, which is approximately 3.5 billion searches per day. The diverse and vast amounts of data are generated with the development of next-generation information technologies such as cryptocurrency, internet of things and big data. To execute such applications, it is needed to design an efficient scheduling algorithm that considers the quality of service parameters like utilization, makespan and response time. Therefore, this paper aims to propose a novel Efficient Static Task Allocation (ESTA) algorithm, which optimizes average utilization. Design/methodology/approach Cloud computing provides resources such as virtual machine, network, storage, etc. over the internet. Cloud computing follows the pay-per-use billing model. To achieve efficient task allocation, scheduling algorithm problems should be interacted and tackled through efficient task distribution on the resources. The methodology of ESTA algorithm is based on minimum completion time approach. ESTA intelligently maps the batch of independent tasks (cloudlets) on heterogeneous virtual machines and optimizes their utilization in infrastructure as a service cloud computing. Findings To evaluate the performance of ESTA, the simulation study is compared with Min-Min, load balancing strategy with migration cost, Longest job in the fastest resource-shortest job in the fastest resource, sufferage, minimum completion time (MCT), minimum execution time and opportunistic load balancing on account of makespan, utilization and response time. Originality/value The simulation result reveals that the ESTA algorithm consistently superior performs under varying of batch independent of cloudlets and the number of virtual machines’ test conditions.


2017 ◽  
Vol 8 (3) ◽  
pp. 53-73
Author(s):  
Raza Abbas Haidri ◽  
Chittaranjan Padmanabh Katti ◽  
Prem Chandra Saxena

The emerging cloud computing technology is the attention of both commercial and academic spheres. Generally, the cost of the faster resource is more than the slower ones, therefore, there is a trade-off between deadline and cost. In this paper, the authors propose a receiver initiated deadline aware load balancing strategy (RDLBS) which tries to meet the deadline of the requests and optimizes the rate of revenue. RDLBS balances the load among the virtual machines (VMs) by migrating the request from the overloaded VMs to underloaded VMs. Turnaround time is also computed for the performance evaluation. The experiments are conducted by using CloudSim simulator and results are compared with existing state of art algorithms with similar objectives.


2020 ◽  
Vol 17 (6) ◽  
pp. 2430-2434
Author(s):  
R. S. Rajput ◽  
Dinesh Goyal ◽  
Rashid Hussain ◽  
Pratham Singh

The cloud computing environment is accomplishing cloud workload by distributing between several nodes or shift to the higher resource so that no computing resource will be overloaded. However, several techniques are used for the management of computing workload in the cloud environment, but still, it is an exciting domain of investigation and research. Control of the workload and scaling of cloud resources are some essential aspects of the cloud computing environment. A well-organized load balancing plan ensures adequate resource utilization. The auto-scaling is a technique to include or terminate additional computing resources based on the scaling policies without involving humans efforts. In the present paper, we developed a method for optimal use of cloud resources by the implementation of a modified auto-scaling feature. We also incorporated an auto-scaling controller for the optimal use of cloud resources.


Sign in / Sign up

Export Citation Format

Share Document