scholarly journals IMPROVED ANT COLONY LOAD BALANCING ALGORITHM IN CLOUD COMPUTING

2015 ◽  
Vol 14 (4) ◽  
pp. 5636-5644
Author(s):  
Jaspreet Singh ◽  
Susmita Mishra

Cloud Computing is an emerging computing paradigm. It aims to share data, calculations, and service transparently over a scalable network of nodes. Since Cloud computing stores the data and disseminated resources in the open environment. Since, cloud has inherited characteristic of distributed computing and virtualization there is a possibility of machines getting unused. Hence, in this paper, a load balancing algorithm has been proposed to avoid deadlocks and to provide proper utilization of all the Virtual Machines (VMs) while processing the requests received from the users by VM migration. Further, this paper also provides the anticipated results with the implementation of the proposed algorithm. The main contributions of our work is to balance the entire system load while trying to minimize the make span of a given set of jobs. Compared with the other job scheduling algorithms, the improved Ant Colony Optimization algorithm can outperform them according to the experimental results.

2005 ◽  
Vol 4 (2) ◽  
pp. 737-741 ◽  
Author(s):  
Amandeep Sidhu ◽  
Supriya Kinger

Cloud Computing is an emerging computing paradigm. It aims to share data, calculations, and service transparently over a scalable network of nodes. Since Cloud computing stores the data and disseminated resources in the open environment. So, the amount of data storage increases quickly. In the cloud storage, load balancing is a key issue. It would consume a lot of cost to maintain load information, since the system is too huge to timely disperse load. Load balancing is one of the main challenges in cloud computing which is required to distribute the dynamic workload across multiple nodes to ensure that no single node is overwhelmed. It helps in optimal utilization of resources and hence in enhancing the performance of the system. A few existing scheduling algorithms can maintain load balancing and provide better strategies through efficient job scheduling and resource allocation techniques as well. In order to gain maximum profits with optimized load balancing algorithms, it is necessary to utilize resources efficiently. This paper discusses some of the existing load balancing algorithms in cloud computing and also their challenges.


2016 ◽  
Vol 15 (9) ◽  
pp. 7124-7129
Author(s):  
Sheenam Kamboj ◽  
Mr. Navtej Singh Ghumman

Cloud Computing is an emerging computing paradigm. It aims to share data, calculations, and service transparently overascalable network of nodes. Since Cloud computing stores the data and disseminated resources in the openenvironment.So, the amount of data storage increases quickly. As we know that a cloud is the collection of many nodes,which can support various types of application that is used by the clients on a basis of pay per use. Therefore, the system,which is incurring a cost for the user should function smoothly and should have algorithms that can continue the propersystem functioning even at peak usage. In this paper, a load balancing algorithm has been discussed and implemented inCloudSim environment. Multiple number of experiments have been conducted to analyze the results.


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. 


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.


2017 ◽  
Vol 16 (1) ◽  
pp. 7581-7585
Author(s):  
Sumanpreet Kaur ◽  
Mr. Navtej Singh Ghumman

Load balancing is one of the essential factors to enhance the working performance of the cloud service provider. Cloud Computing is an emerging computing paradigm. It aims to share data, calculations, and service transparently over a scalable network of nodes. Since Cloud computing stores the data and disseminated resources in the open environment. Since, cloud has inherited characteristic of distributed computing and virtualization there is a possibility of machines getting unused. Hence, in this paper, different load balancing algorithms has been studied. Different kinds of job types have been discussed and their problems have been reviewed. In the cloud storage, load balancing is a key issue. It would consume a lot of cost to maintain load information, since the system is too huge to timely disperse load. Load balancing is one of the main challenges in cloud computing which is required to distribute the dynamic workload across multiple nodes to ensure that no single node is overwhelmed.


Cloud computing is a research trend which bring various cloud services to the users. Cloud environment face various challenges and issues to provide efficient services. In this paper, a novel Genetic Algorithm based load balancing algorithm has been implemented to balance the load in the network. The literature review has been studied to understand the research gap. More specifically, load balancing technique authenticate the network by enabling Virtual Machines (VM). The proposed technique has been further evaluated using the Schedule Length Runtime (SLR) and Energy consumption (EC) parameters. Overall, the effective results has been obtained such as 46% improvement in consuming the energy and 12 % accuracy for the SLR measurement. In addition, results has been compared with the conventional approaches to validate the outcomes.


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.


2019 ◽  
Vol 8 (4) ◽  
pp. 9388-9394 ◽  

Cloud Computing is Internet based computing where one can store and access their personal resources from any computer through Internet. Cloud Computing is a simple pay-per-utilize consumer-provider service model. Cloud is nothing but large pool of easily accessible and usable virtual resources. Task (Job) scheduling is always a noteworthy issue in any computing paradigm. Due to the availability of finite resources and time variant nature of incoming tasks it is very challenging to schedule a new task accurately and assign requested resources to cloud user. Traditional task scheduling techniques are improper for cloud computing as cloud computing is based on virtualization technology with disseminated nature. Cloud computing brings in new challenges for task scheduling due to heterogeneity in hardware capabilities, on-demand service model, pay-per-utilize model and guarantee to meet Quality of Service (QoS). This has motivated us to generate multi-objective methods for task scheduling. In this research paper we have presented multi-objective prediction based task scheduling method in cloud computing to improve load balancing in order to satisfy cloud consumers dynamically changing needs and also to benefit cloud providers for effective resource management. Basically our method gives low probability value for not capable and overloaded nodes. To achieve the same we have used sigmoid function and Euclidean distance. Our major goal is to predict optimal node for task scheduling which satisfies objectives like resource utilization and load balancing with accuracy.


Author(s):  
Saumendu Roy ◽  
Dr. Md. Alam Hossain ◽  
Sujit Kumar Sen ◽  
Nazmul Hossain ◽  
Md. Rashid Al Asif

Load balancing is an integrated aspect of the environment in cloud computing. Cloud computing has lately outgoing technology. It has getting exoteric day by day residence widespread chance in close to posterior. Cloud computing is defined as a massively distributed computing example that is moved by an economic scale in which a repertory of abstracted virtualized energetically. The number of clients in cloud computing is increasing exponentially. The huge amount of user requests attempt to entitle the collection for numerous applications. Which alongside with heavy load not far afield off from cloud server. Whenever particular (Virtual Machine) VMs are overloaded then there are no more duties should be addressed to overloaded VM if under loaded VMs are receivable. For optimizing accomplishment and better response or reaction time the load has to be balanced between overloaded VMs (virtual machines). This Paper describes briefly about the load balancing accession and identifies which is better than others (load balancing algorithm).


Sign in / Sign up

Export Citation Format

Share Document