Skip to main content


Whenever we talk about websites we often tend to be restricted to the domain and hosting only. A person who is generally developing websites does only take care of designing the front end and moreover functionality related to back-end. Most of the  people never thought about the servers and load balancer. Even a student in computer science often confused about the true working of traffic management in servers as well as load balancing it to make sure running the website and application without causing any issue to the end users.

So this article is all about how actually the load balancer work in a real time environment. There are three things that need to understand

1.               Client
2.               Load balancer
3.               Server

Server -Servers are computer programs running to serve the requests of other programs, the clients Thus, the server performs some tasks on behalf of clients. It facilitates the clients to share data, information or any hardware and software resources

The client is the end user who is using the service. The n number of the client accessing the application is what that termed as traffic. If the capacity of a server to handle the request is less than the condition of server down occurs.

The load balancer is nothing but a medium to divert the traffic between various servers according to their capacity such that the load on each server remain the same. The load balancer mainly helps application to maintain its availability all the time. Such as if any server is not working it won't be the problem for the application as Load balancer will divert all the traffic from that server to the remaining one such that user even don't get the feeling of using different server for his/her queries. So let us talk about how everything works in a real time.

There are various load balancing algorithms involved taking care for diverting traffic such as round robin, first come first serve, session management and others. Using session by load balancer is the best thing as it takes care of request coming from the same client and often process the requests to the same server for which earlier it was processed.

Load balancer such as F5 convert the IP address from the client to the required IP address for the server for processing the request and revert again while processing the request from the server to the client.

For more information, you can refer to the following links -



Popular posts from this blog

5 books that your college doesn’t tell to read seriously for PLACEMENTS

1.               Let us C - It can be the best book to pick in your first semester itself. The book is written in a very simple style so you can easily grasp most of the concepts of programming by just working hard on it. It will help you in building basics of programming around c language. 2.               HEAD FIRST JAVA- This book you should buy in third semester and invest your whole second year into it by working on all the codes. This book will help you teaching the concepts in a very attractive way. You will never bore while working  through this book. 3.               Data Structure Made Easy In Java - As soon you finished studying core java in the 4 th semester just pick this book to understand the logic’s of data structure and algorithms. It will help you to go deep inside this subject from which questions are frequently asked in all the interviews. This book carries a great set of problems that will help in developing intellectual knowledge around

Shortest Path from source to Vertex :- Dijkstra Algorithm

Shortest Path from source to Vertex :- Dijkstra Algorithm:- Dijkstra  Algorithms is an algorithm use to find the shortest path from source vertex to a given vertex. package Graph ; import java.util.HashMap ; abstract public class DirectedGraph { Vertex [] vertexlist = new Vertex [ 10 ]; HashMap < Character , HashMap < Character , Integer >> edgelist = new HashMap <>(); Vertex vertex ; //count of vertex and edge static int vertexcount = 0 ; int edgecount = 0 ; /* * This function takes a label and insert in the vertex list as well as edge list since it is new vertex it will add * null to its adjoining vertices */ int addVertex ( char label ) { vertex = new Vertex ( label ); vertexlist [ vertexcount ]= vertex ; System . out . println ( vertexlist [ vertexcount ]. label ); edgelist . put ( vertex . label , null ); vertexcount ++; return vertexcount ; } int addEdge ( char label , char []