Scribd
Upload
170 views

Routing Protocols

The document discusses routing protocols. It begins by defining routing, delivery, forwarding and different types of routing like unicast and multicast routing. It then discusses the key components of routing like routing tables, fields in routing tables, and different unicast routing protocols like RIP, OSPF and BGP. For each protocol, it explains the basic concepts, metrics used, algorithm and how routing tables are calculated. It concludes with a brief discussion on multicast routing and references.

Uploaded by

surendar
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
170 views

Routing Protocols

The document discusses routing protocols. It begins by defining routing, delivery, forwarding and different types of routing like unicast and multicast routing. It then discusses the key components of routing like routing tables, fields in routing tables, and different unicast routing protocols like RIP, OSPF and BGP. For each protocol, it explains the basic concepts, metrics used, algorithm and how routing tables are calculated. It concludes with a brief discussion on multicast routing and references.

Uploaded by

surendar
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 87

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

[email protected] 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

[email protected] 3
Direct and indirect delivery

[email protected] 4
Direct and indirect delivery

[email protected] 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

[email protected] 6
Forwarding Techniques

[email protected] 7
Forwarding Techniques

[email protected] 8
Forwarding Techniques

[email protected] 9
Unicast Routing

[email protected] 10
Types of Routing

[email protected] 11
Routing Tables

[email protected] 12
Routing Table Fields

[email protected] 13
Routing Table Fields

[email protected] 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
[email protected] 15
Metric

[email protected] 16
Metric

[email protected] 17
Intra and Inter Domain Routing

[email protected] 18
Popular routing protocols

[email protected] 19
Distance Vector Routing

[email protected] 20
Distance vector routing tables

[email protected] 21
Initialization

[email protected] 22
Initialization

[email protected] 23
Sharing

[email protected] 24
Note

In distance vector routing, each node


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

[email protected] 25
Updating

[email protected] 26
Updating

[email protected] 27
Updating

[email protected] 28
The Concept of Distance Vector Routing

[email protected] 29
Distance Vector Routing Table

[email protected] 30
Routing Table Distribution

[email protected] 31
Updating Routing Table for Router A

[email protected] 32
Final Routing Tables

[email protected] 33
RIP

[email protected] 34
Example of a domain using RIP

[email protected] 35
RIP

[email protected] 36
Link State Routing

[email protected] 37
Concept of Link State Routing

[email protected] 38
Concept of Link State Routing

[email protected] 39
Link State Knowledge

[email protected] 40
Building Routing Tables

[email protected] 41
Cost in Link State Routing

[email protected] 42
Link State Packet

[email protected] 43
Flooding of As LSP

[email protected] 44
Link State Database

[email protected] 45
Costs in the Dijkstra Algorithm

[email protected] 46
Shortest Path Calculation, Part I

[email protected] 47
Shortest Path Calculation, Part II

[email protected] 48
Shortest Path Calculation, Part IV

[email protected] 49
Shortest Path Calculation, Part III

[email protected] 50
Shortest Path Calculation, Part V

[email protected] 51
Shortest Path Calculation, Part VI

[email protected] 52
Shortest Path Calculation, Part VII

[email protected] 53
Shortest Path Calculation, Part VIII

[email protected] 54
Shortest Path Calculation, Part IX

[email protected] 55
Shortest Path Calculation, Part X

[email protected] 56
Shortest Path Calculation, Part XI

[email protected] 57
Shortest Path Calculation, Part XII

[email protected] 58
Shortest Path Calculation, Part XIII

[email protected] 59
Routing Table for Router A

[email protected] 60
OSPF

[email protected] 61
OSPF

[email protected] 62
Areas in an autonomous system

[email protected] 63
OSPF

[email protected] 64
Types of Links in OSPF

[email protected] 65
Types of Links in OSPF

[email protected] 66
Types of Links in OSPF

[email protected] 67
Path Vector Routing

[email protected] 68
Initialization

[email protected] 69
Initialization

[email protected] 70
Sharing

[email protected] 71
Stabilized tables for four autonomous systems

[email protected] 72
Updating

[email protected] 73
Path Vector Routing

[email protected] 74
BGP

[email protected] 75
BGP

[email protected] 76
BGP Sessions

[email protected] 77
BGP Sessions

[email protected] 78
[email protected] 79
Note

In multicasting, the router may


forward the received packet
through several of its interfaces.

[email protected] 80
Source Based Tree

[email protected] 81
Multicast Routing

[email protected] 82
Source Based Tree

[email protected] 83
Group Shared Tree

[email protected] 84
Group Shared Tree

[email protected] 85
References
Computer Networks,
Tanenbaum A (PHI)

Data Communications and Networking,


Forouzan B (TMH)

[email protected] 86
[email protected] 87

You might also like