Routing & Routing Tables

Hello Friends, In this blog post I am going to let you know about the routing and routing tables. You will see how the data packets travel from source to destination.


Almost everyone is familiar with the general concept of routing. It means that if anyone wants to go from point A to point B, they have to decide on a path to go there.

In the same way, if anybody wants to transfer information between computers situated at two different locations which are connected via a WAN, network protocols must decide how to get it there.

In the case of LANs, organized around a single bus or ring, routing is not a problem. If their connection is with the bridges, the bridges make the routing decision. Topologies are not very complex and bridges perform the routing rather easily.

Routing Tables:

Routing tables may be used by the network nodes similar to the bridges. Here, routing tables do not normally specify the whole route. In place of this, they specify the next node in a route to a specified destination and the cost to go there.

For example, the network in fig1 is considered, where a cost is associated with the connection between two adjacent nodes. Assume that, the cheapest route is to be found which is one that minimizes the sum of the costs of the connection between adjacent nodes. in the route.

As an example, there are many routes from A to F, but the cheapest one goes from A to B (cost of 2) B to E (cost of 3) and E to F(cost of 2) for a total route cost of 7.

Partial route tables of nodes A, B and E are shown in fig 2. Node A’s tables show that anything destined for node B, E or F should be sent directly to B, Where B’s routing table will show the next node in the cheapest route.

In the same way, anything destined for C or D should be sent to node C. From there, the next step is indicated in C’s routing table.

For example, suppose an application at node A wants to send data to node F. Logic at A seems for an entry in its routing table with destination F. From the entry, it can be seen that node B is the successor on the route and the network protocol sends the data to B.

Corresponding to the destination F, logic at B examines its routing table looking for an entry. According to the table’s third entry, the data should go to node E next. At last, the routing table at node E tells that F is the next node on the route.

In the case of any queries, you can write to us at we will get back to you ASAP.

Hope! you would have enjoyed this post about ‘Routing and Routing Tables’.

Please feel free to give your important feedbacks in the comment section below.

Have a great time! Sayonara!


I am a blogger by passion, a software engineer by profession, a singer by consideration and rest of things that I do is for my destination.