Scribd
Upload
54 views4 pages

Day Two

This document summarizes two interior gateway protocols: 1. RIP (Routing Information Protocol) which has limitations such as a network diameter of 15 hops and potential issues with counting to infinity during convergence. Issues like the bouncing effect are addressed using techniques like split horizon. 2. OSPF (Open Shortest Path First) which uses a link-state approach involving database exchange and flooding of link-state advertisements (LSAs) between routers, and uses the Dijkstra algorithm or SPF computation to determine the shortest paths. OSPF also uses mechanisms like hello protocols and DR election.

Uploaded by

api-3756722
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views4 pages

Day Two

This document summarizes two interior gateway protocols: 1. RIP (Routing Information Protocol) which has limitations such as a network diameter of 15 hops and potential issues with counting to infinity during convergence. Issues like the bouncing effect are addressed using techniques like split horizon. 2. OSPF (Open Shortest Path First) which uses a link-state approach involving database exchange and flooding of link-state advertisements (LSAs) between routers, and uses the Dijkstra algorithm or SPF computation to determine the shortest paths. OSPF also uses mechanisms like hello protocols and DR election.

Uploaded by

api-3756722
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

IT Operation Workshop: Day-2

Interior Gateway Protocols

Keyword: RIP, OSPF

Yasuhiro Ohara
WIDE Project

2005/08/31

1
1 RIP
RIPv2 is specified in [1]. RIP has following major limitations.

1. network’s diameter ≤ 15 hops

2. may depend upon ”counting to infinity” to converge

Node A Node B Node C


Time
To via hop To via hop To via hop
C - ∞ C - ∞ C dir 1
routing update
C - ∞ C C 2 C dir 1
routing update
C B 3 C C 2 C dir 1

Figure 1: distance vector principle

2 The problems and remedies

Node A Node B Node C


Time
To via hop To via hop To via hop
C B 3 C C 2 C dir 1

Node A Node B x Node C

C B 3 C - ∞ C dir 1

C B 3 C A 4 C dir 1

Figure 2: Bouncing Effect

2
• Split horizon
• Split horizon with poisonous reverse
• Triggered update

3 OSPF

Figure 3: Database exchange

LSA

Figure 4: LSA flooding

• link state principle


• Link State Advertisement and LSDB
• Dijkstra algorithm or SPF computation
• Hello Protocol
• DR Election
• Areas
• How to set Costs !?

3
References
[1] G. Malkin. RIP Version 2. RFC 2453, IETF, November 1998.

You might also like