Unicast routing protocols--RIP,OSPF,BGP.ppt

TCP/IP Protocol Suite 1
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 11
Unicast
Routing
Protocols

OBJECTIVES:
OBJECTIVES:
 To introduce the idea of autonomous systems (ASs) that divide
the Internet into smaller administrative regions.
 To discuss the idea of distance vector routing and the RIP that is
used to implement the idea.
 To discuss the idea of link state routing as the second intra-AS
routing method and OSPF that is used to implement the idea.
 To discuss the idea of path vector routing as the dominant inter-
AS routing method and BGP that is used to implement the idea.

Chapter
Chapter
Outline
Outline
11.1 Introduction
11.1 Introduction
11.2 Intra- and Inter-Domain
11.2 Intra- and Inter-Domain
Routing
Routing
11.3 Distance Vector Routing
11.3 Distance Vector Routing
11.4 RIP
11.4 RIP
11.5 Link State Routing
11.5 Link State Routing
11.6 OSPF
11.6 OSPF
11.7 Path Vector Routing
11.7 Path Vector Routing
11.8 BGP
11.8 BGP

11-1 INTRODUCTION
An internet is a combination of networks connected
by routers. When a datagram goes from a source to
a destination, it will probably pass through many
routers until it reaches the router attached to the
destination network.

Topics Discussed in the Section
 Cost or Metric
 Static versus Dynamic Routing Table
 Routing Protocol

11-2 INTER- AND INTRA-DOMAIN
ROUTING
Today, an internet can be so large that one routing
protocol cannot handle the task of updating the
routing tables of all routers. For this reason, an
internet is divided into autonomous systems. An
autonomous system (AS) is a group of networks and
routers under the authority of a single administration.
Routing inside an autonomous system is called intra-
domain routing. Routing between autonomous
systems is called inter-domain routing

Figure 11.1 Autonomous systems

Figure 11.2 Popular routing protocols

11-3 DISTANCE VECTOR ROUTING
Today, an internet can be so large that one routing
protocol cannot handle the task of updating the
routing tables of all routers. For this reason, an
internet is divided into autonomous systems. An
autonomous system (AS) is a group of networks and
routers under the authority of a single administration.
Routing inside an autonomous system is called intra-
domain routing. Routing between autonomous
systems is called inter-domain routing
11-2

 Bellman-Ford Algorithm
 Distance Vector Routing Algorithm
 Count to Infinity

Figure 11.3 A graph for Bellman-Ford algorithm

Figure 11.4 The fact behind Bellman-Ford algorithm

Address of
the sender of R

Updating Routing Table
• If the next-node entry is different
– The receiving node chooses the row with
the smaller cost
– If there is a tie, the old one is kept
• If the next-node entry is the same
– i.e. the sender of the new row is the
provider of the old entry
– The receiving node chooses the new row,
even though the new value is infinity.

When to Share
• Periodic Update
– A node sends its routing table, normally 30
seconds, in a periodic update
• Triggered Update
– A node sends its routing table to its
neighbors any time when there is a change
in its routing table
• 1. After updating its routing table, or
• 2. Detects some failure in the neighboring links

Figure 11.5 shows the initial routing table for an AS. Note that
the figure does not mean that all routing tables have been
created at the same time; each router creates its own routing
table when it is booted.
Example
Example 11.1

Figure 11.5 Example 11.1

Now assume router A sends four records to its neighbors,
routers B, D, and C. Figure 11.6 shows the changes in B’s
routing table when it receives these records. We leave the
changes in the routing tables of other neighbors as exercise.
Example
Example 11.2

Net4 , 1
3
Net5 , 1
4
Net2 , 1
2

Figure 11.7 shows the final routing tables for routers in Figure
11.5.
Example
Example 11.3

Figure 11.8 Two-node instability

Two-Node Instability (1)
• Defining Infinity
– Most implementations define 16 as infinity
• Split Horizon
– Instead of flooding the table through each
interface, each node sends only part of its
table through each interface
– E.g. node B thinks that the optimum route
to reach X is via A, it does not need to
advertise this piece of information to A

Two-Node Instability (2)
• Split Horizon and Poison Reverse
– One drawback of Split Horizon
• Normally, the DV protocol uses a timer and if
there is no news about a route, the node deletes
the route from its table
• In the previous e.g., node A cannot guess that
this is due to split horizon or because B has not
received any news about X recently
– Poison Reverse
• Node B can still advertise the value for X, but is
the source of information is A, it can replace
the distance with infinity as a warning

Figure 11.9 Three-node instability
Update loop
until infinity
If the instability is btw
three nodes, stability
cannot be guaranteed

11-4 RIP
The Routing Information Protocol (RIP) is an intra-
domain (interior) routing protocol used inside an
autonomous system. It is a very simple protocol
based on distance vector routing. RIP implements
distance vector routing directly with some
considerations.

 RIP Message Format
 Request and Response
Timers in RIP
 RIP Version 2
 Encapsulation

RIP messages
• Request
– A request message is sent by a router that
has just come up or by a router that has
some time-out entries
– A request can ask about specific entries or
all entries
• Response
– A response can be either solicited or
unsolicited (30s or when there is a change
in the routing table)

RIP Timers
• Periodic timer
– It controls the advertising of regular update
message (25 ~ 30 sec)
• Expiration timer
– It governs the validity of a route (180 sec)
– The route is considered expired and the hop count
of the route is set to 16
• Garbage collection timer
– A invalid route is not purged from the routing
table until this timer expires (120 sec)

RIPv2 vs. RIPv1
• Classless Addressing
• Authentication
• Multicasting
– RIPv1 uses broadcasting to send RIP messages
to every neighbors. Routers as well as hosts
receive the packets
– RIPv2 uses the all-router multicast address to
send the RIP messages only to RIP routers in
the network

Figure 11.10 Example of a domain using RIP

Figure 11.11 RIP message format

Figure 11.12 Request messages

Figure 11.13 shows the update message sent from router R1 to
router R2 in Figure 11.10. The message is sent out of interface
130.10.0.2.
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.
Router R2 also increments each hop count by 1 because the
values in the message are relative to R1, not R2.
Example
Example 11.4

Figure 11.13 Solution to Example 11.4

Figure 11.14 RIP timers

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?
Solution
The 21 timers are listed below:
Periodic timer: 1
Expiration timer: 20 − 5 = 15
Garbage collection timer: 5
Example
Example 11.5

Figure 11.15 RIP version 2 format

Figure 11.16 Authentication

RIP uses the services of UDP on well-
known port 520.
Note

11-5 LINK STATE ROUTING
Link state routing has a different philosophy from
that of distance vector routing. In link state routing, if
each node in the domain has the entire topology of
the domain—the list of nodes and links, how they
are connected including the type, cost (metric), and
the condition of the links (up or down)—the node can
use the Dijkstra algorithm to build a routing table.

 Building Routing tables

Figure 11.17 Concept of Link state routing

Figure 11.18 Link state knowledge

Building Routing Tables
• Creation of the states of the links by
each node, called the link state
packets (LSP)
• Dissemination of LSPs to every other
routers, called flooding (efficiently)
• Formation of a shortest path tree for
each node
• Calculation of a routing table based on
the shortest path tree

Creation of LSP
• LSP data: E.g. the node ID, the list of
links, a sequence number, and age.
• LSP Generation
– When there is a change in the
topology of the domain
– On a periodic basis
• There is no actual need for this type of
LSP, normally 60 minutes or 2 hours

Continued

Figure 11.19 Forming shortest path three for router A in a graph

Figure 11.19 Continued

To show that the shortest path tree for each node is different,
we found the shortest path tree as seen by node C (Figure
11.20). We leave the detail as an exercise.
Example
Example 11.6

11-6 OSPF
The Open Shortest Path First (OSPF) protocol is an
intra-domain routing protocol based on link state
routing. Its domain is also an autonomous system.

 Area
 Metric
 Types of Links
 Graphical Representation
 OSPF Packets
 Link State Update Packet
 Other Packets
 Encapsulation

Figure 11.21 Areas in an autonomous system

Area in OSPF (1)
• A collection of networks with area ID
• Routers inside an area flood the area
with routing information
• Area border routers summarize the
information about the area and send
it to other areas
• Backbone area and backbone routers
– All of the area inside an AS must be
connected to the backbone

Area in OSPF (2)
• Virtual link
– If, because of some problem, the
connectivity between a backbone
and an area is broken, a virtual link
between routers must be created
by the administration to allow
continuity of the functions of the
backbone as the primary area

Figure 11.22 Types of links

Figure 11.23 Point-to-point link

Figure 11.24 Transient link

Figure 11.25 Stub link

Figure 11.26 Example of an AS and its graphical representation in OSPF

Figure 11.27 Types of OSPF packet

Figure 11.28 OSPF common header

Figure 11.29 Link state update packet

Figure 11.30 LSA general header

LSA General Header (1)
• Link state age
– When a router creates the message, the
value of this field is 0
– When each successive router forwards
this message, it estimates the transit
time and adds it to the cumulative value
of this field

• E flag
– If this flag is set to 1, it means the area
is a stub area (an area that is connected
to the backbone area by only one path
• T flag
– If this flag is set to 1, it means the
router can handle multiple types of
services

• Advertising router
– The IP address of the router
advertising this message
• Link state sequence number
– A sequence number assigned to each link
state update message

LS Type and LS ID
Link state type Link state ID
Router link IP address of the router
Network link IP address of the
designated router
Summary link to network Address of the network
Summary link to AS
boundary
IP address of the boundary
router
External link Address of the network

Figure 11.31 Router link

Figure 11.32 Router link LSA

Figure 11.7 shows the final routing tables for routers in Figure
11.5.
Solution
This router has three links: two of type 1 (point-to-point) and
one of type 3 (stub network). Figure 11.34 shows the router link
LSA.
Example
Example 11.7

Figure 11.35 Network link

Figure 11.36 Network link advertisement format

Give the network link LSA in Figure 11.37.
Solution
Solution
The network for which the network link advertises has three
routers attached. The LSA shows the mask and the router
addresses. Figure 11.38 shows the network link LSA.
Example
Example 11.8

In Figure 11.39, which router(s) sends out router link LSAs?
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.
Example
Example 11.9

Figure 11.39 Examples 11.9 and 11.10

In Figure 11.39, which router(s) sends out the network link
LSAs?
Solution
All three networks 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
Example
Example 11.10

Figure 11.40 Summary link to network

Figure 11.41 Summary link to network LSA

Figure 11.42 Summary link to AS boundary router

Figure 11.43 Summary link to AS boundary router LSA

Figure 11.44 External link

Figure 11.45 External link LSA

Figure 11.46 Hello packet
OSPF uses the hello message to create neighborhood
relationship and to test the reachability of neighbors.
This is the first step in link state routing. Before a router can
flood all of the other routers with information about its
neighbors, it must first greet it neighbors.

Figure 11.47 Database description packet
When a router is connected to the system for the first time or
after a failure, it needs the complete link state database
immediately. Therefore, it sends hello packets to greet its
neighbors. If this is the first time that the neighbors hear from
the router, they send a database description message.
The database description packet does not contain complete
database information; it only gives an outline, the title of each
lines in the database.

Figure 11.48 Link state request packet

Figure 11.49 Link state acknowledgment packet

OSPF packets are encapsulated in
IP datagrams.
Note

11-7 PATH VECTOR ROUTING
Distance vector and link state routing are both interior
routing protocols. They can be used inside an
autonomous system. Both of these routing protocols
become intractable when the domain of operation
becomes large. Distance vector routing is subject to
instability if there is more than a few hops in the
domain of operation. Link state routing needs a huge
amount of resources to calculate routing tables. It also
creates heavy traffic because of flooding. There is a
need for a third routing protocol which we call path
vector routing.

 Reachability
 Routing Table

The difference between the distance vector routing and path
vector routing can be compared to the difference between a
national map and an international map. A national map can tell
us the road to each city and the distance to be traveled if we
choose a particular route; an international map can tell us
which cities exist in each country and which countries should
be passed before reaching that city.
Example
Example 11.10

Figure 11.50 Reachability
WAN
WAN

Figure 11.51 Stabilized table for three autonomous system

Figure 11.52 Routing tables after aggregation

11-8 BGP
Border Gateway Protocol (BGP) is an interdomain
routing protocol using path vector routing. It first
appeared in 1989 and has gone through four
versions.

 Types of Autonomous Systems
 Path Attributes
 BGP Sessions
 External and Internal BGP
 Types of Packets
 Packet Format
 Encapsulation

Figure 11.53 Internal and external BGP sessions
A speaker node advertises the path, not the metric of
the nodes, in its AS or other ASs.

Path Vector Routing (1)
• Sharing
– A speaker in an AS shares its table with
immediate neighbors
• Updating
– Adding the nodes that are not in its
routing table and adding its own AS and
the AS that sent the table
– The routing table shows the path
completely

• Loop prevention
– A route checks to see if its AS is in the
path list to the destination
• Policy routing
– If one of the ASs listed in the path is
against its policy, it can ignore that path
and that destination
– It does not update its routing table with
the path, and it does not send this message
to its neighbors

• Optimum path
– Problem: each AS that is included in the
path may use a different criteria for
the metric
– The optimum path is the path that fits
the organization
– For Fig. 14-49, the author chose the one
that had the smaller number of ASs
– Other criteria: security, safety,
reliability, etc.

Types of AS
• Stub AS
– Only one connection to another AS (only a
source or sink for data traffic)
• Multihomed AS
– More than one connection to other AS, but
it is still only a source or sink for data
traffic
• Transit AS
– Multihomed AS that also allows transient
traffic

Figure 11.54 Types of BGP messages

Figure 11.55 BGP packet header

Figure 11.56 Open message

Figure 11.57 Update message

Path Attributes
• ORIGIN
– The source of the routing information
(RIP, OSPF, etc)
• AS_PATH
– The list of ASs through which the
destination can be reached
• NEXT-HOP
– The next router to which the data
packet should be sent

NLRI
• Network layer reachability
information
– It defines the network that is actually
advertised by this message
– Length field and IP address prefix
– BGP4 supports classless addressing and
CIDR

BGP supports classless addressing
and CIDR.
Note

Figure 11.58 Keepalive message

Figure 11.59 Notification message

BGP uses the services of TCP
on port 179.
Note

Unicast routing protocols--RIP,OSPF,BGP.ppt

More Related Content

What's hot (20)

Similar to Unicast routing protocols--RIP,OSPF,BGP.ppt (20)

More from ssuser991de0 (7)

Recently uploaded (20)

Unicast routing protocols--RIP,OSPF,BGP.ppt