c

m

 Upon completion of this chapter, you will
be able to complete the following tasks:
 Distinguish the use and operation of static and
dynamic routes
 Configure and verify a static route
 Identify how distance vector IP routing protocols
such as RIP and IGRP operate on Cisco routers
 Enable Routing Information Protocol (RIP)
 Enable Interior Gateway Routing Protocol (IGRP)
 Verify IP routing with show and debug commands
]
 M


 he process of transferring data from one local area

network to another
 Layer 3 devices
 Routed protocol Enables to forward packet from one
router to another ƛ Ex ƛ IP, IPX
 Routing protocol sends and receives routing
information packets to and from other routers ƛ Ex -
RIP, OSPF , IGRP
 Routing protocols gather and share the routing
information used to maintain and update routing
tables.
 hat routing information is in turn used to route a
routed protocol to its final destination

î
 M


 
 

]cî Ô 

 
Ô] ] 








Ô
 è


M
 
cc

 c
cc

 o route, a router needs to know:

 Destination addresses
 Sources it can learn from
 Possible routes
 Best route

è


M
 
  

cc

 c
cc




r



 

 

 r


 
 cc

  



   c
cc 



 


 







D
 M



 Static routing - network administrator configures

information about remote networks manually. hey are
used to reduce overhead and for security.

 Dynamic routing - information is learned from other

routers, and routing protocols adjust routes
automatically.

 Because of the extra administrative requirements, static

routing does not have the scalability of dynamic routing.

-
 
M




c c  c
{ {

   
c 

· Step-by-step what happens when Host A wants to

communicate with Host B on a different network

· A user on Host A pings Host Bƞs IP address.

 
 

 


 

 c
 
c c 
{  {  c

Î   
c 

V
 

 


 


 

 c  
   c

c c   

{ {
c

 

c 

c
 
 
  
 Host A can ping router R1 and R2
 o enable Host A to Ping Host B we need to configure
Routes

cc
 
M

·he different types of routing are:
· Static routing
· Default routing
· Dynamic routing

c]
 

M

 
· r 


  



!"#
· r $  

$





· Î



 Ú



· Î 

 

 

 



$
%
· &'  
$
%  
  



$
% 

 

   


   



· r '
 
 


$
%

cî
 

M

 


 

M
 
 
 


 
 

 


( M
 Ú  
 



cÔ
 

M

 


 





 

¯

 








¯




¯


· 

 he command used to create the static route.

· ñ
 
 he network youƞre placing in the routing table.
· ¯
 he subnet mask being used on the network.
·  
ññ
 he address of the next-hop router that will receive the packet
and forward it to the remote network. his is a router interface thatƞs on a directly
connected network.
· 

 ùou can use it in place of the next-hop address if you want, but itƞs
got to be on a point-to-point link, such as a WAN
·
ñ¯

ñ
 By default, static routes have an administrative
distance of 1 (or even 0 if you use an exit interface instead of a next-hop address)
· 
¯
 If the interface is shut down, or the router canƞt communicate to the
next-hop router, the route will automatically be discarded from the routing table.
Choosing the permanent option keeps the entry in the routing table no matter what
happens.

M
           

c
 

 

M

 


 

 c  
   c

c c   

{ {
c
R2# config t
R2(config)#ip route 10.0.0.0 255.0.0.0 20.0.0.1
R2(config)#ip route 40.0.0.0 255.0.0.0 30.0.0.2

 

c 

R1# config t
R3# config t
R1(config)#ip route 30.0.0.0 255.0.0.0 20.0.0.2
R3(config)#ip route 10.0.0.0 255.0.0.0 30.0.0.1
R1(config)#ip route 40.0.0.0 255.0.0.0 20.0.0.2
R3(config)#ip route 20.0.0.0 255.0.0.0 30.0.0.1

cD
 À



M

 


 

After static routes are configured it is important to verify that

they are present in the routing table and that routing is
working as expected.

he command  

   is used to view the

active configuration in RAM to verify that the static route was
entered correctly.

he   

 command is used to make sure that the

static route is present in the routing table.

c-
 M¯ 

M


 c  
   c

c c   

{ {
c
R2# config t
R2(config)#no ip route 10.0.0.0 255.0.0.0 20.0.0.1
R2(config)#no ip route 40.0.0.0 255.0.0.0 30.0.0.2

 

c 

R1# config t
R3# config t
R1(config)#no ip route 30.0.0.0 255.0.0.0 20.0.0.2
R3(config)#no ip route 10.0.0.0 255.0.0.0 30.0.0.1
R1(config)#no ip route 40.0.0.0 255.0.0.0 20.0.0.2
R3(config)#no ip route 20.0.0.0 255.0.0.0 30.0.0.1

c 
 Ú


M

 Can only use default routing on stub networks
 Stub networks are those with only one exit path out of
the network
 he only routers that are considered to be in a stub
network are R1 and R3
 c  c  
 

c c {   {
c
 

c  Î 


cV
 Ú


M


 

c
cc

r

c 

c
c

c
c
c







c c  

 his route allows the stub network to reach all known

networks beyond router A.
]
  


Ú


M

Default routes are used to route packets with destinations that do not
match any of the other routes in the routing table.

A default route is actually a special static route that uses this format:

ip route 0.0.0.0 0.0.0.0 [next-hop-address | outgoing interface]

his is sometimes referred to as a ƠQuad-Zeroơ route.

Example using next hop address:

Router(config)#




c c
c

Example using the exit interface:

Router(config)#




 
]c
 

 


 

 c  c
 
 

c c {  

c
{
 

 

c 

]]
 Ú


M



 


 
 c  c
 
 

c c {  

c
{
 

 

c 
M
 

M  



c

 c
M  






 

Mc
 
 M
 

Mc  





  M  





 c

]î
 è




M


  

cc

 c
cc


 Routing protocols are 
used between
routers to determine
paths and maintain
routing tables.
 Once the path is
r



 

  c
c 
determined a router can 
 r

route a routed protocol.
 
 cc

 
 c
c
 
 c
c  c








]Ô
 M




An Autonomous System (AS) is a group of IP networks, which has a
   single and clearly defined routing policy.
Group of routers which can exchange updates
AS are identified by numbers
!!M ! 

 "
 {

{
+,


)
$
"
 



'


$


Î  






&


)
$"
 


'


 
 $Î  
*

*Ô &)"+)"-&cîî]+#]&.Ô

r
$
%/

D- ]
 M





#
 ! {
#
 
#
 !
  !{   



{

{ 
{



*ÔV

'&)"+)"0
 -&cîî]+#]&.Ô
r
$
%/

D- ]D

  ¯

¯






M


  

 An autonomous system is a collection of networks under a

common administrative domain.
 IGPs operate within an autonomous system.
 EGPs connect different autonomous systems

]-






M


  

] 
 





M


  
 Distance Vector
· RIP V1
· IGRP
· RIP V2

 Link state
· OSPF

 Hybrid
· EIGRP

]V
 


M

m


 Classful routing protocols do not include the subnet mask with the
route advertisement.

 Within the same network, consistency of the subnet masks is

assumed.

 Summary routes are exchanged between foreign networks.

 Examples of classful routing protocols:

 RIP Version 1 (RIPv1)
 IGRP

î


M

m

 Classless routing protocols include the subnet mask with
the route advertisement.
 Classless routing protocols support variable-length
subnet masking (VLSM) and subnetting
 Examples of classless routing protocols:
 RIP Version 2 (RIPv2)
 EIGRP
 OSPF
 IS-IS

îc
 Ú

À

M


  

1 

0 0

0
'








 


*
î]
 Ú

À

 Uses Bellman Ford Algorithm
 It needs to find out the shortest path from one network to other
 How to determine which path is best?

c c  c
c c c c

îî
 Ú

À

c c  c
c c c c

 here are two Distance Vector Protocol, Both uses different metric
 RIP ƛ Hops
 IGRP - Composite

îÔ
 Ú

À


c
M


c c c c


c c  c
c

 DV protocol are known as Routing by rumor

 RIP uses only Hop count
 RI routing table metric for 192.168.20.1 network will be
 3
 2

î
 Ú

À

c c
! 
c
! 
M
c
! 
c
c
c c c c


 
c c c c  c c  c


 

 IGGRP uses bandwidth and delay as Metric

 RI routing table metric for 192.168.20.1 network will be
ƛ 30
ƛ 60

îD
 M

 

Î
$
%0

$0%
 









î-





¯
 

ñ

Ú 

M


1 

 



0

 '



*

î 
 
M




1 +
 
 
'

'

0 


$
%*

îV
 
M




  

1 $



0

  

*

Ô
 
M




  

1 M$! 
% 
#&

'    

Ôc
 
M




  

1 M
  
%!!#%
 

Ô]
 




^ 






c






Ôî
 M

 

1
& #&
'  %!%#
 
$

ÔÔ
 Ú


!
¯
¯

1 
'



'0 0



'
0 *

Ô
 !
¯
¯
^ 


 One way of solving routing loop problem is to define a
maximum hop count.

 RIP permits a hop count of up to 15, so anything that

requires 16 hops is deemed unreachable

 he maximum hop count will control how long it takes

for a routing table entry to become invalid

ÔD
 
^
" 

1 & 



'
'


%



'
$

'

*

Ô-
 
^
" 
 Solution to the Routing Loop problem
 Split Horizon is a rule that routing
information cannot be sent back in the
direction from which it was received
 Had split horizon been used in our
example, Router B would not have
included information about network
10.4.0.0 in its update to Router C.

Ô 
 M

 
 Route Poisoning. Usually used in conjunction with split
horizon
 Route poisoning involves explicitly poisoning a routing
table entry for an unreachable network
 Once Router C learned that network 10.4.0.0 was
unavailable it would have immediately poisoned the
route to that network by setting its hop count to the
routing protocolƞs infinity value
 In the case of RIP, that would mean a hop count of 16*

ÔV
 
 
ñ
#ñ

New routing tables are sent to neighboring routers on a regular basis.

RIP updates occur every 30 seconds

However a triggered update is sent immediately in response to some

change in the routing table.

he router that detects a topology change immediately sends an update

message to adjacent routers that, in turn, generate triggered updates
notifying their adjacent neighbors of the change.

riggered updates, used in conjunction with route poisoning, ensure that

all routers know of failed routes.



 
ñ
#ñ

$

 

c
 ^ ññ 
 Holddowns are a technique used to ensure that a route recently
removed or changed is not reinstated by a routing table update
from another route
 Holddown prevents regular update messages from reinstating a
route that is going up and down (called flapping)
 Holddowns prevent routes from changing too rapidly by allowing
time for either the downed route to come back up
 Holddowns make a router wait a period of time before accepting an
update for a network whose status or metric has recently changed

]
 
 
^ ññ 
¯


î
  
   

%

%

c c  c
c c c c
(&%
(&%

Ô