Skip to content

Dynamic Routing

  • Static Routing
    • We have to set each route Manually.
    • Meaning if one of the routes goes down, it requires manual intervention.
  • Dynamic Routing
    • Sends the routing table inbetween the routers.

Metric

A value that represents the cost of a path to a network prefix

  • cost can be measured as
    • hop count
    • bandwidth

Routing Protocol Categories

Interior vs Exterior

If company A signs a deal with ISP 1 and , company B with ISP 4. We need a mechanize for the ISP's to route traffic between each other (Exterior Gateway Protocol)

1
2
3
4
    [Company A]
           |--> {ISP 1} <--> {ISP 1}
                {ISP 3} <--> {ISP 4} <--|
                                 [Company B]

Exterior Gateway Protocols (EGP)

  • Border Gateway Protocol (BPG)
    • is the Protocol the internet uses to transfer routes inbetween ISP's
    • Path Vector Protocol
      • Setup a network with very specific paths.
      • granular control how that protocol distrubutes traffic
  • ISP can route traffic to each other with the use of BGP

Interior Gateway Protocols (IGP)

  • Distance Vector
    • Periodic routing table exchanges
      • will tell the reciving routers how far away network is
    • Bellman-Ford
    • Diffusion Update Algorithm
  • Link State
    • Exchanges link information with entire network
    • Uses Shortest Path First algorithm (Djikstra Algorithm)
Distance Vector Protocols Link State Protocols
Routing Information Protocol (RIP) Open Shorts Path First (OSPF)
Interior Gateway Routing Protocol (IGRP) Intermediate System - Intermediate System (IS-IS)
Enhanced Interior Gateway Routing Protocol (EIGRP)
  • RIP

    • V1

      • Classfull routing protocol
      • It cannot pay attention to the subnet mask at all
    • V2

      • Classless routing protocol
      • It pays attention to the subnet mask!
  • IGRP

    • Classfull
    • Cisco Properitary Protocol
    • Very Slow, Just like rip
  • EIGRP

    • Sophisticated Distance Vector Routing Protocol

Administrative Distance (AD) [IMPORTANT]

For the router to choose which route to the dest network gets added to the table for the protocol

Protocol AD
Directly Connected 0
Static Route 1
EIGRP 90
OSPF 110
IS-IS 115
RIP 120

Metric

Protocol Metric
Directyl connected --
Static Route --
EIGRP Bandwidth + Delay
OSPF Bandwidth
IS-IS Varies (Custom)
RIP Hop Count

Configuring RIP on router

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
en
conf t
router rip
ver 2 # as ver1 does not support cidr.
no auto-summary # utillity in rip, to sumarize a large grp of hosts to a route into one statement
network 10.10.0.0
network 192.168.0.0
do sho run | b router rip
exit
exit

show ip protocols # show configured routing protocols

Open Shortest Path First (OSPF)

  • OSPF
  • uses hello protocol to discover its neighbor.
    • Send out periodic hello messages
    • Hello Protocol Shares
    • Subnet/mask
    • Hello Interval
    • Dead Interval
    • Area ID (By default there must be exists an Area 0!)
    • Authentication(opt)
    • Stub Area Flag
    • MTU size
    • To build a neighbor relationship both neighbor needs to be in the same area

Hello Example

Subnet/ Mask 172.16.0.0/30
Hello Interval 10 sec / 30 sec
Dead Interval 4x Hello Interval
Area ID 0
Authetication (opt) --
Stub Area Flag none
MTU Size Varies

Router ID

an Unique identification to identify routers in ospf - it choose on boot or if rebooted - What can be used as the Router ID? 1. Configured Value 2. Highest IP on loopback interface 3. Highest IP on ANY active interface - Router ID is written in the format as an ipv4 address BUT ITS not an ipv4 addr.

Neighbor Table

This is needed to build a relationshops

Neighbor ID 192.168.10.1
State Init
Dead Time 40sec
Next Hop Address 172.16.0.2
Exit Interface F0/1
  • Link State Advertisement (LSA)
  • Link State Update (LSU)
  • Link State Database (LSDb)
  • Router ID
  • Link ID
  • Link Mask
  • LSA Type

Calculate Routing Table

  • Takes each routers LSDb
  • Uses SPF Algorihm (Djikstra Alorithm)

OSPF Terminology

Messages Types

  • Hello
  • Database Descriptor
  • Link State Request (LSA)
  • If a Routes is missing some data it will send out a request to other routers about it's missing data, and then they will report back with a LSU
  • Link State Update (LSU)
  • Contains Link State Advertisement (LSA)
  • Link State Acknowledgement (LSAck)
  • Acking that we recived data from OSPF

  • LSA Types

  • Type 1 - Router LSA
    • Describes links and costs
  • Type 2 - Network LSA
    • Describes routers in a Broadcast Network
  • Type 3 - Summary LSA

OSPF Neighbors

  • Downside
  • is that you have multiple routers with osfp, it will flood itself with neighbo requests..
  • Designated Router (DR)
  • Main router!
  • Backup Designated Router (BDR)
  • It's the backup of the DR
  • DR-Other
  • is not a backup
  • is not a DR
  • it's the....other one.

EIGRP

Enhanced Interior Gateway Routing Protocol - Distance Vector Protocol - Exchanges routing tables info - in order to populate a topology table - Fast Convergence - 3 tables - Neighbor Table - Topology Table - Routing Table - Diffusion Update Algorithm (DUAL) (Same as SPF in OSPF aka Djikstra) - Successor route - Best Cost - Added to routing table - Feasible successor - Second best cost - Immediately added upon loss of successor route. - Composite Metric - Configured Values - Bandwidth - Delay - Calculated Values - Load - Reliability

Operation

1
    {...} --- [Router A] ------ [Router B] --- {...}
- Hello Message - Send message From A to B and vice versa - It will then build the Routing table - Update Messages - Use RTP, with update messages, to populate the topology table, and use DUAL to calculate it - Acknowledgement - ....mye !