Rip ospf and bgp

AbhishekKesharwani2 7,895 views 78 slides Mar 22, 2015
Slide 1
Slide 1 of 78
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22
Slide 23
23
Slide 24
24
Slide 25
25
Slide 26
26
Slide 27
27
Slide 28
28
Slide 29
29
Slide 30
30
Slide 31
31
Slide 32
32
Slide 33
33
Slide 34
34
Slide 35
35
Slide 36
36
Slide 37
37
Slide 38
38
Slide 39
39
Slide 40
40
Slide 41
41
Slide 42
42
Slide 43
43
Slide 44
44
Slide 45
45
Slide 46
46
Slide 47
47
Slide 48
48
Slide 49
49
Slide 50
50
Slide 51
51
Slide 52
52
Slide 53
53
Slide 54
54
Slide 55
55
Slide 56
56
Slide 57
57
Slide 58
58
Slide 59
59
Slide 60
60
Slide 61
61
Slide 62
62
Slide 63
63
Slide 64
64
Slide 65
65
Slide 66
66
Slide 67
67
Slide 68
68
Slide 69
69
Slide 70
70
Slide 71
71
Slide 72
72
Slide 73
73
Slide 74
74
Slide 75
75
Slide 76
76
Slide 77
77
Slide 78
78

About This Presentation

No description available for this slideshow.


Slide Content

TCP/IP Protocol Suite 1
Unicast Routing Protocols:Unicast Routing Protocols:
RIP, OSPF, and BGPRIP, OSPF, and BGP
• Distinguish between intra and interdomain routing
• Understand distance vector routing and RIP
• Understand link state routing and OSPF
• Understand path vector routing and BGP

TCP/IP Protocol Suite 2
14.1 INTRA- AND INTERDOMAIN
ROUTING
Routing inside an autonomous system is referred to as intradomain Routing inside an autonomous system is referred to as intradomain
routing. Routing between autonomous systems is referred to as routing. Routing between autonomous systems is referred to as
interdomain routing. interdomain routing.

TCP/IP Protocol Suite 3
Figure 14.1 Autonomous systems

TCP/IP Protocol Suite 4
Figure 14.2 Popular routing protocols

TCP/IP Protocol Suite 5
14.2 DISTANCE VECTOR ROUTING
In distance vector routing, the least cost route between any two nodes is In distance vector routing, the least cost route between any two nodes is
the route with minimum distance. In this protocol each node maintains a the route with minimum distance. In this protocol each node maintains a
vector (table) of minimum distances to every nodevector (table) of minimum distances to every node
The topics discussed in this section include:The topics discussed in this section include:
Initialization Initialization
Sharing Sharing
Updating Updating
When to Share When to Share
Two-Node Loop Instability Two-Node Loop Instability
Three-Node Instability Three-Node Instability

TCP/IP Protocol Suite 6
Figure 14.3 Distance vector routing tables

TCP/IP Protocol Suite 7
Figure 14.4 Initialization of tables in distance vector routing

TCP/IP Protocol Suite 8
In distance vector routing, each node
shares its routing table with its
immediate neighbors periodically and
when there is a change.
Note:Note:

TCP/IP Protocol Suite 9
Figure 14.5 Updating in distance vector routing

TCP/IP Protocol Suite 10
Figure 14.6 Two-node instability

TCP/IP Protocol Suite 11
Figure 14.7 Three-node instability

TCP/IP Protocol Suite 12
14.3 RIP
The Routing Information Protocol (RIP) is an intradomain routing The Routing Information Protocol (RIP) is an intradomain routing
protocol used inside an autonomous system. It is a very simple protocol protocol used inside an autonomous system. It is a very simple protocol
based on distance vector routing. based on distance vector routing.
The topics discussed in this section include:The topics discussed in this section include:
RIP Message Format RIP Message Format
Requests and Responses Requests and Responses
Timers in RIP Timers in RIP
RIP Version 2 RIP Version 2
Encapsulation Encapsulation

TCP/IP Protocol Suite 13
Figure 14.8 Example of a domain using RIP

TCP/IP Protocol Suite 14
Figure 14.9 RIP message format

TCP/IP Protocol Suite 15
Figure 14.10 Request messages

TCP/IP Protocol Suite 16
Figure 14.11 shows the update message sent from router R1 to
router R2 in Figure 14.8. The message is sent out of interface
130.10.0.2.
ExamplE 1
See Next Slide
The message is prepared with the combination of split horizon
and poison reverse strategy in mind. Router R1 has obtained
information about networks 195.2.4.0, 195.2.5.0, and 195.2.6.0
from router R2. When R1 sends an update message to R2, it
replaces the actual value of the hop counts for these three
networks with 16 (infinity) to prevent any confusion for R2.
The figure also shows the table extracted from the message.
Router R2 uses the source address of the IP datagram carrying
the RIP message from R1 (130.10.02) as the next hop address.

TCP/IP Protocol Suite 17
Figure 14.11 Solution to Example 1

TCP/IP Protocol Suite 18
Figure 14.12 RIP timers

TCP/IP Protocol Suite 19
A routing table has 20 entries. It does not receive information
about five routes for 200 s. How many timers are running at
this time?
ExamplE 2
Solution
The 21 timers are listed below:
Periodic timer: 1
Expiration timer: 20 − 5 = 15
Garbage collection timer: 5

TCP/IP Protocol Suite 20
Figure 14.13 RIP version 2 format

TCP/IP Protocol Suite 21
Figure 14.14 Authentication

TCP/IP Protocol Suite 22
RIP uses the services of UDP on
well-known port 520.
Note:Note:

TCP/IP Protocol Suite 23
14.4 LINK STATE ROUTING
In link state routing, if each node in the domain has the entire topology In link state routing, if each node in the domain has the entire topology
of the domain, the node can use Dijkstra’s algorithm to build a routing of the domain, the node can use Dijkstra’s algorithm to build a routing
table.table.
The topics discussed in this section include:The topics discussed in this section include:
Building Routing Tables Building Routing Tables

TCP/IP Protocol Suite 24
Figure 14.15 Concept of link state routing

TCP/IP Protocol Suite 25
Figure 14.16 Link state knowledge

TCP/IP Protocol Suite 26
Figure 14.17 Dijkstra algorithm

TCP/IP Protocol Suite 27
Figure 14.18 Example of formation of shortest path tree

TCP/IP Protocol Suite 28
Table 14.1 Table 14.1 Routing table for node ARouting table for node A

TCP/IP Protocol Suite 29
14.5 OSPF
The Open Shortest Path First (OSPF) protocol is an intradomain The Open Shortest Path First (OSPF) protocol is an intradomain
routing protocol based on link state routing. Its domain is also an routing protocol based on link state routing. Its domain is also an
autonomous system. autonomous system.
The topics discussed in this section include:The topics discussed in this section include:
Areas Areas
Metric Metric
Types of Links Types of Links
Graphical Representation Graphical Representation
OSPF Packets OSPF Packets
Link State Update Packet Link State Update Packet
Other Packets Other Packets
Encapsulation Encapsulation

TCP/IP Protocol Suite 30
Figure 14.19 Areas in an autonomous system

TCP/IP Protocol Suite 31
Figure 14.20 Types of links

TCP/IP Protocol Suite 32
Figure 14.21 Point-to-point link

TCP/IP Protocol Suite 33
Figure 14.22 Transient link

TCP/IP Protocol Suite 34
Figure 14.23 Stub link

TCP/IP Protocol Suite 35
Figure 14.24 Example of an AS and its graphical representation in OSPF

TCP/IP Protocol Suite 36
Figure 14.25 Types of OSPF packets

TCP/IP Protocol Suite 37
Figure 14.26 OSPF common header

TCP/IP Protocol Suite 38
Figure 14.27 Link state update packet

TCP/IP Protocol Suite 39
Figure 14.28 LSA general header

TCP/IP Protocol Suite 40
Figure 14.29 Router link

TCP/IP Protocol Suite 41
Figure 14.30 Router link LSA

TCP/IP Protocol Suite 42
Table 14.2 Table 14.2 Link types, link identification, and link dataLink types, link identification, and link data

TCP/IP Protocol Suite 43
Give the router link LSA sent by router 10.24.7.9 in
Figure 14.31.
ExamplE 3
Solution
This router has three links: two of type 1 (point-to-
point) and one of type 3 (stub network). Figure 14.32
shows the router link LSA.
See Next Slide
See Figure 14.32

TCP/IP Protocol Suite 44
Figure 14.31 Example 3

TCP/IP Protocol Suite 45
Figure 14.32 Solution to Example 3

TCP/IP Protocol Suite 46
Figure 14.33 Network link

TCP/IP Protocol Suite 47
Figure 14.34 Network link advertisement format

TCP/IP Protocol Suite 48
Give the network link LSA in Figure 14.35.
ExamplE 4
Solution.
See Next Slide
See Figure 14.36

TCP/IP Protocol Suite 49
Figure 14.35 Example 4

TCP/IP Protocol Suite 50
Figure 14.36 Solution to Example 4

TCP/IP Protocol Suite 51
In Figure 14.37, which router(s) sends out router link LSAs?
ExamplE 5
Solution
All routers advertise router link LSAs.
a. R1 has two links, N1 and N2.
b. R2 has one link, N1.
c. R3 has two links, N2 and N3.
See Next Slide

TCP/IP Protocol Suite 52
Figure 14.37 Example 5 and Example 6

TCP/IP Protocol Suite 53
In Figure 14.37, which router(s) sends out the network link
LSAs?
ExamplE 6
Solution
All three network must advertise network links:
a. Advertisement for N1 is done by R1 because it is the only
attached router and therefore the designated router.
b. Advertisement for N2 can be done by either R1, R2, or R3,
depending on which one is chosen as the designated router.
c. Advertisement for N3 is done by R3 because it is the only
attached router and therefore the designated router.

TCP/IP Protocol Suite 54
Figure 14.38 Summary link to network

TCP/IP Protocol Suite 55
Figure 14.39 Summary link to network LSA

TCP/IP Protocol Suite 56
Figure 14.40 Summary link to AS boundary router

TCP/IP Protocol Suite 57
Figure 14.41 Summary link to AS boundary router LSA

TCP/IP Protocol Suite 58
Figure 14.42 External link

TCP/IP Protocol Suite 59
Figure 14.43 External link LSA

TCP/IP Protocol Suite 60
Figure 14.44 Hello packet

TCP/IP Protocol Suite 61
Figure 14.45 Database description packet

TCP/IP Protocol Suite 62
Figure 14.46 Link state request packet

TCP/IP Protocol Suite 63
Figure 14.47 Link state acknowledgment packet

TCP/IP Protocol Suite 64
OSPF packets are encapsulated in IP
datagrams.
Note:Note:

TCP/IP Protocol Suite 65
14.6 PATH VECTOR ROUTING
Path vector routing is similar to distance vector routing. There is at least Path vector routing is similar to distance vector routing. There is at least
one node, called the speaker node, in each AS that creates a routing one node, called the speaker node, in each AS that creates a routing
table and advertises it to speaker nodes in the neighboring ASs.. table and advertises it to speaker nodes in the neighboring ASs..
The topics discussed in this section include:The topics discussed in this section include:
Initialization Initialization
Sharing Sharing
Updating Updating

TCP/IP Protocol Suite 66
Figure 14.48 Initial routing tables in path vector routing

TCP/IP Protocol Suite 67
Figure 14.49 Stabilized tables for four autonomous systems

TCP/IP Protocol Suite 68
14.7 BGP
Border Gateway Protocol (BGP) is an interdomain routing protocol Border Gateway Protocol (BGP) is an interdomain routing protocol
using path vector routing. It first appeared in 1989 and has gone using path vector routing. It first appeared in 1989 and has gone
through four versions. through four versions.
The topics discussed in this section include:The topics discussed in this section include:
Types of Autonomous Systems Types of Autonomous Systems
Path Attributes Path Attributes
BGP Sessions BGP Sessions
External and Internal BGP External and Internal BGP
Types of Packets Types of Packets
Packet Format Packet Format
Encapsulation Encapsulation

TCP/IP Protocol Suite 69
Figure 14.50 Internal and external BGP sessions

TCP/IP Protocol Suite 70
Figure 14.51 Types of BGP messages

TCP/IP Protocol Suite 71
Figure 14.52 BGP packet header

TCP/IP Protocol Suite 72
Figure 14.53 Open message

TCP/IP Protocol Suite 73
Figure 14.54 Update message

TCP/IP Protocol Suite 74
BGP supports classless addressing and
CIDR.
Note:Note:

TCP/IP Protocol Suite 75
Figure 14.55 Keepalive message

TCP/IP Protocol Suite 76
Figure 14.56 Notification message

TCP/IP Protocol Suite 77
Table 14.3 Table 14.3 Error codesError codes

TCP/IP Protocol Suite 78
BGP uses the services of TCP
on port 179.
Note:Note:
Tags