Performance Profiling of Load Balancing Algorithms in a Cloud Architecture

Author(s):  
Samirah Salifu ◽  
Nathan Turlington ◽  
Michael Galloway
Author(s):  
Istabraq M. Al-Joboury ◽  
Emad H. Al-Hemiary

Fog Computing is a new concept made by Cisco to provide same functionalities of Cloud Computing but near to Things to enhance performance such as reduce delay and response time. Packet loss may occur on single Fog server over a huge number of messages from Things because of several factors like limited bandwidth and capacity of queues in server. In this paper, Internet of Things based Fog-to-Cloud architecture is proposed to solve the problem of packet loss on Fog server using Load Balancing and virtualization. The architecture consists of 5 layers, namely: Things, gateway, Fog, Cloud, and application. Fog layer is virtualized to specified number of Fog servers using Graphical Network Simulator-3 and VirtualBox on local physical server. Server Load Balancing router is configured to distribute the huge traffic in Weighted Round Robin technique using Message Queue Telemetry Transport protocol. Then, maximum message from Fog layer are selected and sent to Cloud layer and the rest of messages are deleted within 1 hour using our proposed Data-in-Motion technique for storage, processing, and monitoring of messages. Thus, improving the performance of the Fog layer for storage and processing of messages, as well as reducing the packet loss to half and increasing throughput to 4 times than using single Fog server.


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.


2003 ◽  
Vol 123 (10) ◽  
pp. 1847-1857
Author(s):  
Takahiro Tsukishima ◽  
Masahiro Sato ◽  
Hisashi Onari
Keyword(s):  

2014 ◽  
Vol 134 (8) ◽  
pp. 1104-1113
Author(s):  
Shinji Kitagami ◽  
Yosuke Kaneko ◽  
Hidetoshi Kambe ◽  
Shigeki Nankaku ◽  
Takuo Suganuma
Keyword(s):  

2013 ◽  
Vol 133 (4) ◽  
pp. 891-898
Author(s):  
Takeo Sakairi ◽  
Masashi Watanabe ◽  
Katsuyuki Kamei ◽  
Takashi Tamada ◽  
Yukio Goto ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document