Scribd
Upload
15 views9 pages

010 Routing _ Routing table

Routing (networking)

Uploaded by

mohammedrameesp873
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views9 pages

010 Routing _ Routing table

Routing (networking)

Uploaded by

mohammedrameesp873
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Routing

Routing table
Routing table
●
Routing is the process of sending a packet of information from one network to
another network.
●
Thus, routes are usually based on the destination network.
●
And not the destination host (host routes can exist, but are used only in rare
circumstances).
●
To route, routers build Routing Tables that contain the following:
– The destination network and subnet mask
– The “next hop” router to get to the destination network
– Routing metrics and Administrative Distance

3
●
The routing table is concerned with two types of protocols:
– 1. Routed protocol: It is a layer 3 protocol that applies logical addresses to
devices and routes data between networks.
●
Examples would be IP and IPX.
– 2. Routing protocol: It dynamically builds the network, topology, and next hop
information in routing tables.
●
Examples would be RIP, EIGRP, OSPF, etc.

4
●
To determine the best route to a destination, a router considers three elements (in
this order):
– 1. Prefix-Length
– 2. Metric (within a routing protocol)
– 3. Administrative Distance (between separate routing protocols)

5
1. Prefix length
●
Prefix-length is the number of bits used to identify the network, and is used to
determine the most specific route.
●
A longer prefix-length indicates a more specific route.
●
For example, assume we are trying to reach a host address of 10.1.5.2/24. If we had
routes to the following networks in the routing table:
– 10.1.5.0/24
– 10.0.0.0/8
●
The router will do a bit-by-bit comparison to find the most specific route (i.e., longest
matching prefix).
●
Since the 10.1.5.0/24 network is more specific, that route will be used, regardless of
metric or Administrative Distance.

6
2. Metric
●
A “metric” allows a router to choose the best path within a routing protocol.
●
Distance vector routing protocols use “distance” (usually hop-count) as their metric.
●
Link state protocols utilize some sort of “cost” as their metric.
●
Only routes with the best metric are added to the routing table.
●
Thus, even if a particular routing protocol (for example, RIP) has four routes to the
same network, only the route with the best metric (hop-count in this example) would
make it to the routing table.
●
If multiple equal-metric routes exist to a particular network, most routing protocols will
load-balance.

7
AD values of common routing protocols
Sl. No: Routing AD value
1. Connected 0
2. Static 1
3. EIGRP Summary 5
4. External BGP 20
5. Internal EIGRP 90
* Lowest will win.
6. IGRP 100
7. OSPF 110
8. IS-IS 115
9. RIP 120
10. External EIGRP 170
11 Internal BGP 200
12 Unknown 255

8
●
To determine the best route to a destination, a router considers three elements (in
this order):
– 1. Prefix-Length
– 2. Metric (within a routing protocol)
– 3. Administrative Distance (between separate routing protocols)

You might also like