Question

1. Different algorithms are used to make decisions on load balancing. These include random allocation, round-robin, weighted round-robin, round-robin DNS load balancing, and others. Use the Internet to research load-balancing algorithms. Do any of these algorithms compromise security

Answer 1

Answer:

The algorithms and their advantages-disadvantages are given below.

Explanation:

1. Least Connection

Advantage:

The load balances track the transfers constantly, as well as read the details.

Disadvantage:

Server efficiency is indeed not optimal because there are different application computing abilities.

2. Round robin:

Advantage:

Implementation is simple and easily understandable.

Disadvantage:

This methodology or algorithm seems to be suitable for more than just clusters composed of servers with similar specs.

3.  Least Loaded Algorithm

Advantage:

We relate to that as the base technique, and then use it as the basis for comparison with several other strategies results.

Disadvantage:

Such knowledge is almost always unclear when the demands appear, and therefore it is quite hard to accomplish to be using the standard algorithm.

4. Dynamic Round Robin

Advantage:

Easy to execute, it calculates almost all of the server pressures in real-time.

Disadvantage:

Might trigger one processor to overrun while some are underutilized.

5. Weighted Round-Robin Allocation

Advantage:

This is an evolved round-robin edition that removes the shortcomings of that algorithm in a straightforward round.

Disadvantage:

It doesn't quite recognize the specialized criteria for high availability, including response times for each application.