Routing Protocols

By
Farhan M.Shaikh
B.Sc. (CS),M.Sc. (IT), B.Ed.,M.Ed., M.A (Sociology)., UGC-NET (Education/ Sociology)

Visiting Faculty
L.S. Raheja College, SantaCruz
Tolani College, Andheri
Pioneer Education Center, Borivali, Andheri & Vasai
L.I.I.T., Dadar & Mulund
Unit 1 : Routing Protocols
Delivery, Forwarding, Routing
Types of Routing
Routing Tables
Unicast Routing
Unicast Routing Protocols
RIP, Concepts of OSPF and BGP
Multicast Routing

farhan.mohd@yahoo.co.in 2
DELIVERY

The network layer supervises the handling of the

packets by the underlying physical networks. We
define this handling as the delivery of a packet.

Topics discussed in this section:

Direct Versus Indirect Delivery

farhan.mohd@yahoo.co.in 3
Direct and indirect delivery

farhan.mohd@yahoo.co.in 4
Direct and indirect delivery

farhan.mohd@yahoo.co.in 5
FORWARDING

Forwarding means to place the packet in its route to

its destination. Forwarding requires a host or a router
to have a routing table. When a host has a packet to
send or when a router has received a packet to be
forwarded, it looks at this table to find the route to the
final destination.

Topics discussed in this section:

Forwarding Techniques

farhan.mohd@yahoo.co.in 6
Forwarding Techniques

farhan.mohd@yahoo.co.in 7
Forwarding Techniques

farhan.mohd@yahoo.co.in 8
Forwarding Techniques

farhan.mohd@yahoo.co.in 9
Unicast Routing

farhan.mohd@yahoo.co.in 10
Types of Routing

farhan.mohd@yahoo.co.in 11
Routing Tables

farhan.mohd@yahoo.co.in 12
Routing Table Fields

farhan.mohd@yahoo.co.in 13
Routing Table Fields

farhan.mohd@yahoo.co.in 14
UNICASTROUTINGPROTOCOLS

A routing table can be either static or dynamic. A static

table is one with manual entries. A dynamic table is
one that is updated automatically when there is a
change somewhere in the Internet. A routing protocol
is a combination of rules and procedures that lets
routers in the Internet inform each other of changes.
Topics discussed in this section:
Metric
Intra- and Interdomain Routing
Distance Vector Routing and RIP
Link State Routing and OSPF
Path Vector Routing and BGP
farhan.mohd@yahoo.co.in 15
Metric

farhan.mohd@yahoo.co.in 16
Metric

farhan.mohd@yahoo.co.in 17
Intra and Inter Domain Routing

farhan.mohd@yahoo.co.in 18
Popular routing protocols

farhan.mohd@yahoo.co.in 19
Distance Vector Routing

farhan.mohd@yahoo.co.in 20
Distance vector routing tables

farhan.mohd@yahoo.co.in 21
Initialization

farhan.mohd@yahoo.co.in 22
Initialization

farhan.mohd@yahoo.co.in 23
Sharing

farhan.mohd@yahoo.co.in 24
Note

In distance vector routing, each node

shares its routing table with its
immediate neighbors periodically and
when there is a change.

farhan.mohd@yahoo.co.in 25
Updating

farhan.mohd@yahoo.co.in 26
Updating

farhan.mohd@yahoo.co.in 27
Updating

farhan.mohd@yahoo.co.in 28
The Concept of Distance Vector Routing

farhan.mohd@yahoo.co.in 29
Distance Vector Routing Table

farhan.mohd@yahoo.co.in 30
Routing Table Distribution

farhan.mohd@yahoo.co.in 31
Updating Routing Table for Router A

farhan.mohd@yahoo.co.in 32
Final Routing Tables

farhan.mohd@yahoo.co.in 33
RIP

farhan.mohd@yahoo.co.in 34
Example of a domain using RIP

farhan.mohd@yahoo.co.in 35
RIP

farhan.mohd@yahoo.co.in 36
Link State Routing

farhan.mohd@yahoo.co.in 37
Concept of Link State Routing

farhan.mohd@yahoo.co.in 38
Concept of Link State Routing

farhan.mohd@yahoo.co.in 39
Link State Knowledge

farhan.mohd@yahoo.co.in 40
Building Routing Tables

farhan.mohd@yahoo.co.in 41
Cost in Link State Routing

farhan.mohd@yahoo.co.in 42
Link State Packet

farhan.mohd@yahoo.co.in 43
Flooding of As LSP

farhan.mohd@yahoo.co.in 44
Link State Database

farhan.mohd@yahoo.co.in 45
Costs in the Dijkstra Algorithm

farhan.mohd@yahoo.co.in 46
Shortest Path Calculation, Part I

farhan.mohd@yahoo.co.in 47
Shortest Path Calculation, Part II

farhan.mohd@yahoo.co.in 48
Shortest Path Calculation, Part IV

farhan.mohd@yahoo.co.in 49
Shortest Path Calculation, Part III

farhan.mohd@yahoo.co.in 50
Shortest Path Calculation, Part V

farhan.mohd@yahoo.co.in 51
Shortest Path Calculation, Part VI

farhan.mohd@yahoo.co.in 52
Shortest Path Calculation, Part VII

farhan.mohd@yahoo.co.in 53
Shortest Path Calculation, Part VIII

farhan.mohd@yahoo.co.in 54
Shortest Path Calculation, Part IX

farhan.mohd@yahoo.co.in 55
Shortest Path Calculation, Part X

farhan.mohd@yahoo.co.in 56
Shortest Path Calculation, Part XI

farhan.mohd@yahoo.co.in 57
Shortest Path Calculation, Part XII

farhan.mohd@yahoo.co.in 58
Shortest Path Calculation, Part XIII

farhan.mohd@yahoo.co.in 59
Routing Table for Router A

farhan.mohd@yahoo.co.in 60
OSPF

farhan.mohd@yahoo.co.in 61
OSPF

farhan.mohd@yahoo.co.in 62
Areas in an autonomous system

farhan.mohd@yahoo.co.in 63
OSPF

farhan.mohd@yahoo.co.in 64
Types of Links in OSPF

farhan.mohd@yahoo.co.in 65
Types of Links in OSPF

farhan.mohd@yahoo.co.in 66
Types of Links in OSPF

farhan.mohd@yahoo.co.in 67
Path Vector Routing

farhan.mohd@yahoo.co.in 68
Initialization

farhan.mohd@yahoo.co.in 69
Initialization

farhan.mohd@yahoo.co.in 70
Sharing

farhan.mohd@yahoo.co.in 71
Stabilized tables for four autonomous systems

farhan.mohd@yahoo.co.in 72
Updating

farhan.mohd@yahoo.co.in 73
Path Vector Routing

farhan.mohd@yahoo.co.in 74
BGP

farhan.mohd@yahoo.co.in 75
BGP

farhan.mohd@yahoo.co.in 76
BGP Sessions

farhan.mohd@yahoo.co.in 77
BGP Sessions

farhan.mohd@yahoo.co.in 78
farhan.mohd@yahoo.co.in 79
Note

In multicasting, the router may

forward the received packet
through several of its interfaces.

farhan.mohd@yahoo.co.in 80
Source Based Tree

farhan.mohd@yahoo.co.in 81
Multicast Routing

farhan.mohd@yahoo.co.in 82
Source Based Tree

farhan.mohd@yahoo.co.in 83
Group Shared Tree

farhan.mohd@yahoo.co.in 84
Group Shared Tree

farhan.mohd@yahoo.co.in 85
References
Computer Networks,
Tanenbaum A (PHI)

Data Communications and Networking,

Forouzan B (TMH)

farhan.mohd@yahoo.co.in 86
farhan.mohd@yahoo.co.in 87