ROUTING

• Forwarding of data between different networks in called

“Routing”

• Directly Connected

• Indirectly connected

• Process of selecting the correct circuit path for a message

• Directly / Indirectly connected networks

STATIC ROUTING
• This routing is manually defined by operator

• Configuration
• Destination network ID
• Subnet Mask
• Directly connected next HOP IP Addres

• Command
(Config)# ip route D.N S.M Next Hop IP Add
Important Terms for Dynamic Routing

• AD
• Administrative
Distance(Trustworthiness of
router)
• Directly Connected=0
• Static=1
• Similarly dynamic routing
protocols have defined AD

• Metric
• Path calculation criteria of router
DYNAMIC
ROUTING
• Protocols are used to find
networks and update routing
tables
• Routing protocol defines rules that
communicates information
between neighbor routers
• Classification of Routing Protocols
• Distance Vector
• Link State
• Hybrid
CLASSIFICATION
Distance Vector Link State Hybrid
Neighbor Dependent Neighbor Independent Neighbor Dependent

Routing loops possible Loop free Loop free

Max Hop Limit

Max Hop Limit No Max Hop Limit

1 Table 3 Tables 3 Tables

e.g. RIP, IGRP e.g. OSPF e.g. EIGRP

RIP (Routing Information protocol)
• Developed in 1980
• Open standard
• Distance vector routing protocol
• AD = 120
• Metric = Hop count
• Max hop = 15
• Update timer = 30 sec
• Slow Convergence
• Algorithm was developed by
Bellman’s Ford
• RIP V1= Classful and RIP V2= Classless
IGRP (Interior Gateway Routing Protocol)
• Developed in 1986
• Cisco proprietary
• Distance vector routing protocol
• AD = 100
• Metric = Bandwidth + Delay
• Max hop = 100/250
• Update timer = 90 sec
• Slow Convergence
• Broadcast its routing table
• Algorithm was developed by Bellman’s Ford
EIGRP (Enhance Interior Gateway Routing Protocol)
• Cisco proprietary
• Hybrid routing protocol
• AD = 90
• Metric = Bandwidth + Delay
• Hello interval = 5 sec
• Dead interval = 15 sec
• Max hop = 100/250
• Rapid Convergence
• Classless
• Loopfree
• Tables: 1. Routing table 2.Topology table (diagram) 3. Neighbor table
• Algorithm was developed by J J Garcia
OSPF (Open Shortest Path First)
• Open standard
• Link state routing protocol - Concept of Router ID.
• AD = 110 - Concept of Areas
• Metric = Bandwidth - Concept of DR, BDR.
• Hello interval = 10 sec
• Dead interval = 40 sec
• No Max Hop
• Fast Convergence
• Classless
• Shares LSA
• Tables: 1. Routing table 2. Database table (diagram) 3. Neighbor table
• Algorithm = SPF
OSPF Neighbor
OSPF routers will only become neighbors if the following parameters
within a Hello packet are identical on each router:
• Area ID
• Area Type (stub, NSSA, etc.)
• Subnet Mask
• Hello Interval
• Dead Interval
• Network Type (broadcast, point-to-point, etc.)
• Authentication
OSPF Hierarchy