1. (How the routers’ tables are filled in)
Chapter 11
Unicast Routing
Protocols
(RIP, OSPF, BGP)
(How the routers’ tables are filled in)
Dr. Clincy

2. Finish covering RIP – already covered algorithm and protocol
Dr. Clincy

3. RIP message format
Command – 8-bit field specifying the type of message: response (2) or request (1)
Version – 8-bit field specifying RIP version
Family – 16-bit specifying protocol family (TCP/IP=2)
Network Address – address of the destination network
Distance – 32-bit field defining the hop count from advertising router to destination network
NOTE: Request can be issued by a newly added router or by a router seeking certain info
NOTE: 2 response types: Solicited – response to request, Unsolicited – periodic updates
Gray fields repeated for each destination network
Dr. Clincy

4. Example 1
What is the periodic response sent by router R1 in the figure below. Assume R1 knows about the whole autonomous system.
Dr. Clincy

5. Solution
R1 can advertise three networks , , and The periodic response (update packet) is shown below
Dr. Clincy

6. RIP timers
Periodic Timer – each router has timer set to secs and when the timer counts down, an update message is sent
Expiration Timer – governs the validity of the next-hop – when router receives next-hop update, timer is set to 180 sec. If there is a problem and the router doesn’t receive it’s 30 sec update, the route info expires (invalid) after the 180 sec count down – then the hop count is set to 16 (infinity)
Garbage Collection Timer – once the route expires, this timer is set to 120 sec and counts downs – allows neighbors time to become aware of invalidity – after count down, info is purged
Dr. Clincy

7. Problems with RIP
Slow Convergence – the time it takes a change in the Internet to propagate through the rest of the Internet – recall the periodic updates with neighbors. DEPENDING ON THE DATA RATE, millions or billions of bits could be sent in that time – therefore possibly lost
nx15s
Dr. Clincy

8. RIP Problem - Instability
RA and RB has hop counts 1 and 2, respectively for Net1
Net1 goes down – RA can update fast due to direct connection – sets hop count to 16
RA has to wait 30 sec to update RB (this is the problem)
In meanwhile, RB sends update to RA with hop count 2 for Net1 (incremented to 3)
Now when RA finally send the update to RB, it sends a hop count of 3 (incremented to 4) – RA thinks it’s another route to Net1
This INSTABILITY (back-and-forth) continues until both set hop count to 16
Dr. Clincy

9. Popular Unicast Routing protocols
RIP (already covered) – Routing Information Protocol – treats each network the same (assigns the same cost for each network)
OSPF – Open Shortest Path First protocol – assigns a cost for passing through a network based on the type of service required – routes through the network can have different cost – each router would have several tables
BGP – Border Gateway Protocol – is an exterior routing protocol that uses a policy that defines what paths should be chosen
Dr. Clincy

10. OSPF: Open Shortest Path First
Similar to RIP however, divide autonomous system into areas
Routers with in an area floods the area with routing info – router sends to all it’s neighbors and each neighbor sends to all it’s neighbors and etc..
At the border of an area, special routers called area border routers are used to (1) summarize info about an area and (2) send info amongst areas
A special area called the backbone is used to tie together all of the areas – backbone is primary area and all other areas are secondary areas – backbone area uses backbone routers
Note: backbone router can also be an area border router
Each area has an ID (backbone’s Id is 0)
Explain Current Real World Practices relating to this topic
Dr. Clincy

11. Recall OSPF: Open Shortest Path First
The OSPF is similar to RIP however, it allows the admin the ability to assign a cost or metric to each route.
The metric can be based on a type of service (ie . Min delay, max throughput, etc..)
For OSPF, a router will have multiple routing tables – one for each TOS
Unlike RIP, sharing or updating is done when there is a change (not periodically)
For OSPF, the objective is for the routers to contain the full picture or topology of the Internet – by having this, the router can figure out the “shortest path” or “least cost” route between itself and each network
To do this, the Internet is represented by a graph – set of edges and nodes
Dr. Clincy

12. Defining edges or connections/links
Point-to-point link
Virtual link
Direct connection between two routers, no IP address needed
Bi-directional Edge
When link between two routers are broken, admin creates a new route across multiple routers
Transient link
Stub link
Represents the network
Connects to only one router – packets enter and leave through this same router
Dr. Clincy

13. Graphical representation of an internet
Dr. Clincy

14. OSPF uses Dijkstra’s Shortest Path Algorithm
Dr. Clincy

15. Dijkstra’s Algorithm Cont..
Dr. Clincy

16. Dijkstra’s Algorithm Continued
At this point, we would have the least cost path from A to all other nodes
Note: to find the least cost paths from E to all other nodes, Disjkstra’s algorithm has to run again
Dr. Clincy

17. Answer in Hyphen Format
A-D
A-D-N3
A-D-N3-F
A-D-N3-F-N5
A-N1
A-N1-B
A-N1-B-E
A-N1-B-E-N4
A-N1-C
A-N1-C-N2
Dr. Clincy

18. How do the OSPF packets travel across the network(s) ??????????????
A re-occurring theme
How do the OSPF packets travel across the network(s) ??????????????
Dr. Clincy

19. OSPF packets are encapsulated in IP datagrams.
Dr. Clincy

20. BGP: Border Gateway Protocol
BPG is an inter-autonomous system routing protocol that makes use of path vector routing
For BPG, each routing entry contains (1) destination network, (2) next router (hop) and (3) entire path to reach destination
Path is an ordered list of autonomous systems that the packet should travel through to make it to the destination
Dr. Clincy