Dynamic Routing Protocols

Thursday, August 25, 2016 10:10

Factors not considered by routing protocols

Physical Distances
Delay
Congestion
RIP -> Lowest hop count
IS-IS -> Lowest cost route

Distance Vector Routing Protocol

Also known as Bellman-Ford algorithm
Router passes a copy of its routing table periodically
Routing tables metric indicates Hop-Count
Router selects route with the lowest metric
Routers don't have a complete topology of the network

Operations of Link-State Routing Protocol

Each router distributes information about its local topology. Information includes:
Destination networks attached to the router and other links
Each link has associated metric (cost) which is the bandwidth
Packet that carries topology information
In OSPF => LSA (Link-State Advertisement)
In IS-IS => PDU (Link-State Protocol Data Unit)
After a router has received all the topology information, it has a complete information about
the all the networks.
It then calculate the shortest Path to every destination using the SFP algorithm.

Common Attributes of OSPF and IS-IS

Triggered updates when a link (interface) changes state.
Supports authentication
Classless
Summarization
Updates and Hello Messages are sent to multicast address

Link-State Protocols maintain three common databases

Adjacency Database (neighbor database)
Built through exchange of periodic hellos
Link-State Database (LSDB or topology database)
Stores the most recent topology information
Must the same on all routers in the routing domain.
Forwarding Database

Dynamic Routing Protocol Seite 1

Basic Operation of OSPF/IS-IS
Thursday, August 25, 2016 10:15

Send Hello messages out each interface to discover directly attached neighbors and build the
adjacency database
Create a link-state packet (LSP) describing the routers local topology. This contains
information about directly connected networks, links to neighbors, and their cost. Send the
LSP and any other LSPs the router has received to its adjacent neighbors.
Collect all the LSPs in the LSDB and run the SPF algorithm to build the forwarding database.
Any time there is a change in the local topology, create a new LSP and flood it to all other
routers. Rerun SPF and rebuild the forwarding database.
When a new LSP is received from a neighbor, update the LSDB, flood the LSP to its neighbors,
and rerun SPF to rebuild the forwarding database.

Link-State Routing Protocols

Link-State Protocols use sequence numbers to make flooding reliable and to ensure that LSDB
is up to date
LS Packets always contain a sequence number which is maintained by the router which
created the information
Link-State Information also includes an age field.
This age is changed as the information is flooded and while it is held in the LSDB
When the maximum age is reached, the router removes the LS Information from the
LSDB.

NB: IS-IS do not always generate an acknowledgement for information updates.

Dynamic Routing Protocol Seite 2