Efficient on Demand Dynamic Availability-Distribution-Span Scheduling and Load Balancing Scheme for Cloud Computing

2016 ◽  
Vol 13 (10) ◽  
pp. 7655-7660 ◽  
Author(s):  
V Jeyakrishnan ◽  
P Sengottuvelan

The problem of load balancing in cloud environment has been approached by different scheduling algorithms. Still the performance of cloud environment has not been met to the point and to overcome these issues, we propose a naval ADS (Availability-Distribution-Span) Scheduling method to perform load balancing as well as scheduling the resources of cloud environment. The method performs scheduling and load balancing in on demand nature and takes dynamic actions to fulfill the request of users. At the time of request, the method identifies set of resources required by the process and computes Availability Factor, Distributional Factor and Span Time factor for each of the resource available. Based on all these factors computed, the method schedules the requests to be processed in least span time. The proposed method produces efficient result on scheduling as well as load balancing to improve the performance of resource utilization in the cloud environment.

Author(s):  
Minakshi Sharma ◽  
Rajneesh Kumar ◽  
Anurag Jain

Cloud load balancing is done to persist the services in the cloud environment along with quality of service (QoS) parameters. An efficient load balancing algorithm should be based on better optimization of these QoS parameters which results in efficient scheduling. Most of the load balancing algorithms which exist consider response time or resource utilization constraints but an efficient algorithm must consider both perspectives from the user side and cloud service provider side. This article presents a load balancing strategy that efficiently allocates tasks to virtualized resources to get maximum resource utilization in minimum response time. The proposed approach, join minimum loaded queue (JMLQ), is based on the existing join idle queue (JIQ) model that has been modified by replacing idle servers in the I-queues with servers having one task in execution list. The results of simulation in CloudSim verify that the proposed approach efficiently maximizes resource utilization by reducing the response time in comparison to its other variants.


2019 ◽  
Vol 16 (2) ◽  
pp. 764-767
Author(s):  
P. Chitra ◽  
Karthika D. Renuka ◽  
K. Senathipathi ◽  
S. Deepika ◽  
R. Geethamani

Cloud computing is the cutting edge technology in the information field to provide services to the users over the internet through web–based tools and applications. One of the major aspects of cloud computing is load balancing. Challenges like Quality of service (QoS) metrics and resource utilization can be improved by balancing the load in cloud environment. Specific scheduling criteria can be applied using load balancing for users prioritization. This paper surveys different load balancing algorithms. The approaches that are existing are discussed and analyzed to provide fair load balancing and also a comparative analysis was presented for the performance of the existing different load balancing schemes.


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.


Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.


2017 ◽  
Vol 15 (14) ◽  
pp. 7444-7452
Author(s):  
Jagdeep Singh ◽  
Mr. Pawan Luthra

Cloud computing is one of the latest and upcoming paradigm that offers huge benefits such as reduced time to market, unlimited computing power and flexible computing capabilities. It is a model that provides an on-demand network access to a shared pool of computing resources It comprises a large number of concepts primarily Load Balancing, Scheduling, etc. This paper discusses load balancing as a mechanism to distribute the workload evenly to all nodes in the system to achieve a higher resource utilization and user satisfaction. It helps in allocation and de-allocation of instances of applications without   failure. This paper reports a new load balancing technique using modified credit based system using task length, task priority and its cost. The proposed algorithm has been implemented in cloudsim toolkit and its comparison with existing algorithm has been discussed in the paper.


Author(s):  
Deepika Saxena ◽  
Ashutosh Kumar Singh

Background: Load balancing of communication-intensive applications, allowing efficient resource utilization and minimization of power consumption is a challenging multi-objective virtual machine (VM) placement problem. The communication among inter-dependent VMs, raises network traffic, hampers cloud client's experience and degrades overall performance, by saturating the network. Introduction: Cloud computing has become an indispensable part of Information Technology (IT), which supports the backbone of digitization throughout the world. It provides shared pool of IT resources, which are: always on, accessible from anywhere, at anytime and delivered on demand, as a service. The scalability and pay-per-use benefits of cloud computing has driven the entire world towards on-demand IT services that facilitates increased usage of virtualized resources. The rapid growth in the demands of cloud resources has amplified the network traffic in and out of the datacenter. Cisco Global Cloud Index predicts that by the year 2021, the network traffic among the devices within the datacenter will grow at Compound Annual Growth Rate (CAGR) of 23.4% Methods: To address these issues, a communication cost aware and resource efficient load balancing (CARE-LB) framework is presented, that minimizes communication cost, power consumption and maximize resource utilization. To reduce the communication cost, VMs with high affinity and inter-dependency are intentionally placed closer to each other. The VM placement is carried out by applying the proposed integration of Particle Swarm Optimization and non-dominated sorting based Genetic Algorithm i.e. PSOGA algorithm encoding VM allocation as particles as well as chromosomes. Results: The performance of proposed framework is evaluated by the execution of numerous experiments in the simulated datacenter environment and it is compared with the state-of-the-art methods like, Genetic Algorithm, First-Fit, Random-Fit and Best-Fit heuristic algorithms. The experimental outcome reveals that the CARE-LB framework improves 11% resource utilization, minimize 4.4% power consumption, 20.3% communication cost with reduction of execution time up to 49.7% over Genetic Algorithm based Load Balancing framework. Conclusion: The proposed CARE-LB framework provides promising solution for faster execution of data-intensive applications with improved resource utilization and reduced power consumption. Discussion: In the observed simulation, we analyze all the three objectives, after execution of the proposed multi-objective VM allocations and results are shown in Table 4. To choose the number of users for analysis of communication cost, the experiments are conducted with different number of users. For instance, for 100 VMs we choose 10, 20,...,80 users, and their request for VMs (number of VMs and type of VMs) are generated randomly, such that the total number of requested VMs do not exceed number of available VMs.


2015 ◽  
Vol 14 (12) ◽  
pp. 6326-6333
Author(s):  
Settu Bharti ◽  
Naseeb Singh

Cloud computing is one of the latest and upcoming paradigm that offers huge benefits such as reduced time to market, unlimited computing power and flexible computing capabilities. It is a model that provides an on-demand network access to a shared pool of computing resources It comprises a large number of concepts primarily Load Balancing, Scheduling, etc. This paper discusses load balancing as a mechanism to distribute the workload evenly to all nodes in the system to achieve a higher resource utilization and user satisfaction. It helps in allocation and de-allocation of instances of applications without   failure. This paper reports a new load balancing technique and its comparison with existing algorithm providing better results. 


Author(s):  
Zakaria Benlalia ◽  
Karim Abouelmehdi ◽  
Abderrahim Beni-hssane ◽  
Abdellah Ezzati

<p>Cloud computing has emerged as a new paradigm for providing on-demand computing resources and outsourcing software and hardware infrastructures. Load balancing is one of the major concerns in cloud computing environment means how to distribute load efficiently among all the nodes. For solving such a problem, we need some load balancing algorithms, so in this paper we will compare the existing algorithms for web application.and based on results obtained we choose the best among them.</p>


2020 ◽  
Vol 8 (5) ◽  
pp. 4830-4834

Cloud computing is a model that provides computing environment where a shared pool of resources are provisioned to customers as a service via the internet. Task scheduling forms the essential part of cloud environment. The scheduling of task in cloud mainly focuses on reducing average waiting time, Makespan and maximizes resource utilization which in turn reduces the response time of the system. This paper study various scheduling algorithms in cloud computing environments.


The computing resource availability in a cloud computing environment is considered as the vital attribute among the security essentialities due to the consequence of on its on demand service. The class of adversaries related to the Distributed Denial of Service (DDoS) attack is prevalent in the cloud infrastructure for exploiting the vulnerabilities during the implementation of their attack that still make the process of providing security and availability at the same time as a challenging objective. In specific, The in cloud computing is the major threat during the process of balancing security and availability at the same time. In this paper, A Reliable Friedman Hypothesis-based Detection and Adaptive Load Balancing Scheme (RFALBS-RoQ-DDOS) is contributed for effective detection of RoQDDoS attacks through Friedman hypothesis testing. It also inherited an adaptive load balancing approach that prevents the degree of imbalance in the cloud environment. The simulation results of the proposed RFALBS-RoQ-DDoS technique confirmed a superior detection rate and a adaptive load balancing rate of nearly 23% and 28% predominant to the baseline DDoS mitigation schemes considered for investigation.


Sign in / Sign up

Export Citation Format

Share Document