z-logo
open-access-imgOpen Access
RHLB: Improved Routing Load Balancing Algorithm Based on Hybrid Policy
Author(s) -
Muna Mohammed Jawad,
Noor M. Mahdi
Publication year - 2019
Publication title -
journal of university of babylon for engineering sciences
Language(s) - English
Resource type - Journals
ISSN - 2616-9916
DOI - 10.29196/jubes.v27i1.2005
Subject(s) - computer science , load balancing (electrical power) , computer network , network traffic control , network congestion , packet loss , distributed computing , network packet , workload , network delay , algorithm , grid , geometry , mathematics , operating system
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom