scholarly journals Modified load balancing algorithm for partially-overlapping data transmission routes

Author(s):  
Oleksandr Kaliuzhnyi

In this paper we propose a modified load balancing algorithm, which can be used to optimize network load and reduce data transmission delay. This algorithm is aimed at load balancing between partially-overlappung data transmission routes. It is based on a modified ECMP algorithm with correction of the load on the network and taking into account the length of possible paths. This algorithm is optimal for centralized network management, and therefore its use in SDN networks is proposed. Testing of this development is carried out for comparison with the existing solution and the advantages of this modification are presented.

2012 ◽  
Vol 182-183 ◽  
pp. 1978-1981 ◽  
Author(s):  
Li Lan ◽  
Chu Huan Qi

The utilization efficiency of system resources is a key issue for cluster system while load balance is an important tool to realize the efficient use of resources. Based on server cluster system, this paper puts forwards an improved self-adaptive algorithm for network load balancing. Simulation results show that the algorithm can improve the utilization efficiency of system resource and reduce the server’s response time so as to achieve the request of real time when dealing with tasks and high availability of system.


The cloud/utility computing model requires a dynamic task assignment to cloud sites with the goal that the performance and demand handling is done as effectively as would be prudent. Efficient load balancing and proper allocation of resources are vital systems to improve the execution of different services and make legitimate usage of existing assets in the cloud computing atmosphere. Consequently, the cloud-based infrastructure has numerous kinds of load concerns such as CPU load, server load, memory drain, network load, etc. Thus, an appropriate load balancing system helps in realizing failures, reducing backlog problems, adaptability, proper resource distribution, expanding dependability and client fulfillment and so forth in distributed environment. This thesis reviewed various popular load balancing algorithms. Modified round robin algorithms are popularly employed by various giant companies for scheduling issues and load balancing. An enhanced weighted round robin algorithm is discussed in this paper concentrating on efficient load balancing and effective task scheduling and resource management.


Author(s):  
Oleksandr Kaliuzhnyi

In this work we propose a method for organizing multipath routing for SDN networks. It have two main parts. The fisrt one is a routing method based on modified wave algorithm for finding paths, and second one is load balancing method based on ECMP algorithm. Combination of these methods can optimize using of network resources and provide a more optimal load balancing of network. The basis of routing algorithm is the search and use partially-overlapping routes. The basis of load balancing algorithm is equal distribution network load between all found routes. A comparative analysis with an existing algorithms for routing and load balancing was conducted and the advantages of this development are presented.


Author(s):  
Hind Sounni ◽  
Najib El kamoun ◽  
Fatima Lakrami

Nowadays, the emergence of IoT devices has wholly revolutionized the customer's communication habits. The information can be collected at anytime and anywhere. However, the mobility of communication devices in a dense network results in an unbalanced network load and an increase in bandwidth demands. To address these issues, this study proposed a load balancing algorithm based on SDN for enhancing the performance of mobile IoT devices communication over a Wi-Fi network. The use of the SDN makes possible the automatic configuration of the network through a centralized controller, it provides programmability, a global view of the network, it also optimizes resource allocation based on real-time network information that helps implement our algorithm. The proposed algorithm is evaluated through simulation using mininet. The results indicate that our proposed method provides an efficient network load balancing and improves the throughput of associated devices.


2019 ◽  
Vol 27 (1) ◽  
pp. 324-337
Author(s):  
Muna Mohammed Jawad ◽  
Noor Mohammed Mahdi

A network is defined as a set of nodes that are associated with a way to handle and transfer data and messages from source to destination. The congestion in the network occurs when a lot of traffic occurs, leads to delay, packet loss, bandwidth degradation, and high network overhead. Load balancing algorithms have been designed to reduce congestion in the network. Load Balancing is the redistribution of workload between two or more nodes to be executed at the same time. Two policies of load balancing algorithms: static and dynamic load balancing. This paper proposes a load balancing algorithm based on the hybrid (static and dynamic) policy using Network Simulator (version 2). The hybrid policy is used to improve network performance by redistributing the load between overloaded nodes to other nodes that are under loaded when congestion occurs. The simulation results show that the proposed algorithm used performance of the network with regard to throughput, packet delivery ratio, packet loss and the end-to-end delay.


Author(s):  
ZULFIKHAR AHMAD ◽  
ASHIS KU. MISHRA ◽  
BIKASH CHANDRA ROUT

“Cloud computing” is a term, which involves virtualization, distributed computing, networking, software and Web services. Our Objective is to develop an effective load balancing algorithm using Divisible Load Scheduling Theorem to maximize or minimize different performance parameters (throughput, latency for example) for the clouds of different sizes. Central to these issues lays the establishment of an efficient load balancing algorithm. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all processor in the system or every node in the network does approximately the equal amount of work at any instant of time.


Author(s):  
Quoc-Thinh Nguyen-Vuong ◽  
Nazim Agoulmine

The paper aims at improving the load balancing algorithm in wireless packet cellular networks and particularly in coordinated heterogeneous wireless packet networks. Our main contributions are two-fold. First, we introduce a new approach to compute the network load metric based on the radio link quality and scheduling information, which can be applied to any wireless packet system. This load metric hides the radio resources heterogeneity of different access technologies from the load balancer. Secondly, we propose a new practical load balancing algorithm which provides a more efficient way to manage the scarce radio resources. The proposed approach has been compared with different existing schemes and the results show the superiority of the proposed solution.


Sign in / Sign up

Export Citation Format

Share Document