Web Server Load Balancing Based on Number of Client Connections on Docker Swarm

Anun, Karar Haider; Almhanna, Mahdi S.

doi:10.1109/it-ela52201.2021.9773748

Cited by 6 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Every task is non-preemptive (once it starts the execution on the server, we cannot interrupt it until the execution finished). When several functions given to be executed and require processing on two or more servers, the major concern of the manager is to find the order or sequence to perform these functions [3], [10]- [12]. We can broadly divide these sequence problems into two groups.…”

Section: Methods 21 Principal Assumptionsmentioning

confidence: 99%

Reducing waiting and idle time for a group of jobs in the grid computing

Almhanna¹,

Al-Turaihi²,

Murshedi³

2023

Bulletin EEI

View full text Add to dashboard Cite

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.

show abstract

Section: Methods 21 Principal Assumptionsmentioning

confidence: 99%

Reducing waiting and idle time for a group of jobs in the grid computing

Almhanna¹,

Al-Turaihi²,

Murshedi³

2023

Bulletin EEI

View full text Add to dashboard Cite

show abstract

“…Server load balancing (LB) 4 in SDN is a critical function that optimizes the distribution of incoming network traffic across multiple servers or server instances to improve performance, enhance reliability, and prevent server overload exploiting the concept of a decentralized approach using a cluster of servers that share the network load and provide redundancy if one server goes down. 5 SDN-based LB offers several advantages over traditional LB methods, as it leverages the central control and programmability features of SDN.…”

Section: Introductionmentioning

confidence: 99%

Load balancing algorithms in SDN networks with multiple servers

Masaquiza Caiza,

Maigualema Quimbita,

Tropea

2024

Disruptive Technologies in Information Sciences VIII

View full text Add to dashboard Cite

In recent years, the interest in Software-Defined Networking (SDN) has been very high. Many applications of traditional networking have been implemented in SDN environments in order to test the performance of the different network devices. In this paper, server load-balancing (LB) based on SDN has been developed and tested to verify the effectiveness of this approach inside the new networking approach. In our implementation, we have used a RYU controller for controlling and managing network devices and two different LB algorithms have been implemented. We have performed an analysis of these two algorithms with a system without load balancing in a server-client system changing the number of servers and clients in order to show the performance of the SDN network.

show abstract

“…The utilization of computing allows organizations to integrate geographically dispersed resources from different administrative regions into a unified system. This consolidation facilitates the resolution of largescale problems across scientific, human, and social domains [1][2][3][4][5]. These resources include diverse components like computers, storage, peripherals, and applications.…”

Section: Introductionmentioning

confidence: 99%

Utilizing Probability Distribution for Selecting Optimal and Minimal Replicas to Achieving Fault Tolerance in a Distributed System

2024

IJIES

View full text Add to dashboard Cite

This paper highlights the importance of efficient task distribution and robust fault tolerance in network systems. It emphasizes the limitations of relying on a fixed resource quantity and proposes task replication as a solution to improve data availability. The introduced algorithm dynamically determines the optimal number of replicas based on network history, response time, and joint probability of successful servers, aiming to minimize task failure rates. The algorithm's advancements in grid scheduling lie in optimal resource management, fault-aware job placement, adaptability to changing conditions, and efficient fault tolerance through redundancy planning. The algorithm outperforms three other algorithms, showcasing significant enhancements.

show abstract

Web Server Load Balancing Based on Number of Client Connections on Docker Swarm

Cited by 6 publications

References 9 publications

Reducing waiting and idle time for a group of jobs in the grid computing

Reducing waiting and idle time for a group of jobs in the grid computing

Load balancing algorithms in SDN networks with multiple servers

Utilizing Probability Distribution for Selecting Optimal and Minimal Replicas to Achieving Fault Tolerance in a Distributed System

Contact Info

Product

Resources

About