Abstract-A Mobile Ad Hoc Network (MANET) is an infrastructure-less, self-organized and multi-hop network with a rapidly changing topology causing the wireless links to be broken at any time. Routing in such a network is challenging due to the mobility of its nodes and the challenge becomes more difficult when the network size increases. Due to the limited capacity of a multi-hop path and the high dynamics of wireless links, the single-path routing approach is unable to provide efficient high data rate transmission in MANETs. The multipath routing is the routing technique of using multiple alternative paths through a network. Furthermore, whenever a link failure is detected on a primary route, the source node can select the optimal route among multiple available routes. Therefore, the multipath routing approach is broadly utilized as one of the possible solutions to overcome the single-path limitation. Most of the multipath routing protocols are based on Ad Hoc On-Demand Distance Vector (AODV). The objective of this paper is to provide a survey and compare sets of multipath routing protocols for mobile ad-hoc networks. This survey will motivate the design of new multipath routing protocols, which overcome the weaknesses identified in this paper.Index Terms-Mobile ad-hoc networks, on-demand multipath routing, single path routing, dynamic source routing, ad hoc on-demand distance vector.

Abstract

Load balancing is a critical aspect of managing server resources efficiently and ensuring optimal performance in distributed systems. The Weighted Round Robin (WRR) algorithm is commonly used to allocate incoming requests among servers based on their assigned weights. However, static weights may not reflect the changing demands of servers, leading to imbalanced workloads. To address this issue, this study proposes a dynamic mechanism for assigning weights to servers in the WRR algorithm based on the data rate and incorporates the Least Connection approach for the best result. The dynamic mechanism takes into account the real-time data rate of each server, representing its current load. Servers with higher data rates are assigned higher weights to attract a larger share of incoming requests, while those with lower data rates receive lower weights to manage their loads effectively. This dynamic weight assignment allows the algorithm to adapt to varying workloads and achieve better load balancing across servers. To further refine the distribution of requests, the Least Connection approach is employed to handle tie-breaking situations and for more fairness in distributing the loads. The proposed algorithm is a hybrid of data rate and the Least Connection, it is evaluated through simulations and real-world experiments. The results demonstrate its superiority in achieving improved load balance compared to traditional static-weight WRR algorithms. By dynamically adjusting weights based on data rate and employing the Least Connection approach, the algorithm optimizes server resource usage, minimizes response times, and enhances overall system performance in distributed environments.

Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find the perfect sequence of functions to reduce the amount of idle time, and it also reduces the total time required to complete all functions. It is a suitable method for scheduling the purposes of two functions in a specific time-dependent sequence for both functions and where the time factor is the only parameter used in this way. Therefore, it is not suitable for scheduling work for computers network, where there are many factors affecting the completion time such as CPU speed, memory, bandwidth, and size of data. In this research, Johnson's method will adopt by adding many factors that affect the completion time of the work so that it becomes suitable for the site’s job scheduling purposes to reduce the waiting and idle time for a group of jobs.