Scribd
Upload
10 views24 pages

Rip Ospf

in this presentation we discussed about the ospf networking

Uploaded by

IMRAN Mehdi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
10 views24 pages

Rip Ospf

in this presentation we discussed about the ospf networking

Uploaded by

IMRAN Mehdi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 24

Dynamic Routing Protocols

1
Routing

• Recall: There are two parts to routing IP packets:


1. How to pass a packet from an input interface to the
output interface of a router
(packet forwarding) ?
2. How to find and setup a route ?

• We already discussed the packet forwarding part

• There are two approaches for calculating the routing tables:


– Static Routing
– Dynamic Routing: Routes are calculated by a routing protocol

2
Autonomous Systems

• An autonomous system is a region of the Internet that is


administered by a single entity.
• Examples of autonomous regions are:
• UVA’s campus network
• MCI’s backbone network
• Regional Internet Service Provider

• Routing is done differently within an autonomous system


(intradomain routing) and between autonomous system
(interdomain routing).

3
Autonomous Systems (AS)

Ethernet Ethernet Autonomous


System 1

Router Ethernet Router

Router

Router Ethernet

Autonomous
Ethernet
Router System 2 Router
Ethernet

4
Interdomain and Intradomain Routing

Intradomain Routing Interdomain Routing


• Routing within an AS • Routing between AS’s
• Ignores the Internet outside the • Assumes that the Internet
AS consists of a collection of
• Protocols for Intradomain routing interconnected AS’s
are also called Interior Gateway • Normally, there is one dedicated
Protocols or IGP’s. router in each AS that handles
• Popular protocols are interdomain traffic.
– RIP (simple, old) • Protocols for interdomain routing
– OSPF (better) are also called Exterior Gateway
Protocols or EGP’s.
• Routing protocols:
– EGP
– BGP (more recent)

5
Components of a Routing Algorithm

• A procedure for sending and receiving reachability information


about network to other routers

• A procedure for calculating optimal routes


– Routes are calculated using a shortest path algorithm:
• Goal: Given a network were each link is assigned a
cost. Find the path with the least cost between two
networks with minimum cost.

• A procedure for reacting to and advertising topology changes

6
Approaches to Shortest Path Routing

• There are two basic routing algorithms found on the Internet.


1. Distance Vector Routing
• Each node knows the distance (=cost) to its directly connected neighbors
• A node sends periodically a list of routing updates to its neighbors.
• If all nodes update their distances, the routing tables eventually converge
• New nodes advertise themselves to their neighbors

2. Link State Routing


• Each node knows the distance to its neighbors
• The distance information (=link state) is broadcast to all nodes in the network
• Each node calculates the routing tables independently

7
Routing Algorithms in the Internet

Distance Vector Link State

• Routing Information Protocol • Intermediate System -


(RIP) Intermediate System (IS-IS)

• Gateway-to-Gateway Protocol • Open Shortest Path First


(GGP) (OSPF)

• Exterior Gateway Protocol (EGP)

• Interior Gateway Routing Protocol


(IGRP)

8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy