Load Balancing Routing in Multi-Channel HybridWireless Networks with Single Network Interface

Author(s):  
Jungmin So ◽  
N.H. Vaidya
2001 ◽  
Vol 9 (4) ◽  
pp. 211-222 ◽  
Author(s):  
Marian Bubak ◽  
Dariusz Żbik ◽  
Dick van Albada ◽  
Kamil Iskra ◽  
Peter Sloot

Efficient load balancing is essential for parallel distributed computing. Many parallel computing environments use TCP or UDP through the socket interface as a communication mechanism. This paper presents the design and development of a prototype implementation of a network interface that can preserve communication between processes during process migration. This new communication library is a substitution for the well-known socket interface. It is implemented in user — space; it is portable, and no modifications of user applications are required. TCP/IP is applied for internal communication, which guarantees relatively high performance and portability.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 48686-48696
Author(s):  
Hermano Pereira ◽  
Guilherme Luiz Moritz ◽  
Richard Demo Souza ◽  
Anelise Munaretto ◽  
Mauro Fonseca

2014 ◽  
Vol 667 ◽  
pp. 121-124
Author(s):  
Ning Lv ◽  
Jing Li Zhou

Network striping is a well-known technique that can transparently utilize parallel, redundant links in order to improve the performance and reliability of the network interface. However, most of existing scheduling schemes designed for load balancing do not consider the factor of available bandwidth of multi-link. To overcome this disadvantage, in this paper, we propose a novel method called Available Bandwidth based Dynamic Load Balancing (ABDLB) to address this issue. Using available bandwidth obtained by periodically probing, at the host, packets are proportionally allocated to multiple links according to the probed results. The simulation results demonstrate that our proposed algorithm achieves better performance than traditional scheduling methods.


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):  

Sign in / Sign up

Export Citation Format

Share Document