The This report mainly focuses on two scheduling

The Purposeof this report is to show how the round robin and weighted round robin aredeveloped for solving network based traffic problems. Nowadays Application forthe web are developing violently, causinggigantic of system loads.

This high development rateleads to decrease in performance and responding time in networks. The solutionto resolve this kind of traffic issues is using Load balancer with schedulingalgorithm between the user requesting the job and the server. It creates amultiple server distributed system to distribute the loads. Fig.1 shows how thenetwork would look like from an overview.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

Since an arrangement with distributedloads around its multiple server’s yields in better Network performance. Figure 1     There aremany different scheduling algorithm for load balancer. Mainly the Schedulingalgorithm is divided into two types.

The first one being preemptive and the secondone being non-preemptive. Preemptive scheduling can be interrupted during theprocess but the non-preemptive can’t be interrupted between processes. There alot of criteria looked to compare a good scheduling algorithm (www.tutorialspoint.com, 2018): ·        CPU Utilization: Algorithm should always keep the CPU bebusy as much as possible. This makes the use of CPU more efficient algorithmand better network.·        Throughput: It’s the number of jobs possible to be doneby system in an hour.

It should be optimised to do Maximum number of jobs perhour for efficient algorithm.·        Response time: The time taken for the Load balancer tostart responding to the request. There should be less response time for efficientalgorithm.·        Turnaround time: The time user has to wait for the jobrequest to be completed. The time should be minimum for efficient algorithm.·        Waiting time: It’s the time a job waits to be assigned tothe node to complete its work. This should also be minimised for efficient al·        Fairness: A good scheduler make sure that all process getfair share of the CPU.This reportmainly focuses on two scheduling algorithm.

Initially using the round robin andthen weighted round robin to control the load more efficiently in distributednetwork.

x

Hi!
I'm Mary!

Would you like to get a custom essay? How about receiving a customized one?

Check it out