Routing -Computer Networks-Lecture Slides, Slides of Computer Networks

This lecture is part of lecture series delivered by Prof. Deepak Rai at Anna University of Technology for Computer Networks course. Its main points are: Routing, Static, Dynamic, Approaches, Link, State, Autonomous, Systems, Interior, Exterior, Allocation

Typology: Slides

2011/2012

Uploaded on 07/07/2012

bhaji
bhaji 🇮🇳

3.8

(5)

83 documents

1 / 31

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Computer Networking
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f

Partial preview of the text

Download Routing -Computer Networks-Lecture Slides and more Slides Computer Networks in PDF only on Docsity!

Computer Networking

Today’s Lecture

  • What is Routing

 Definition and Concepts

 Static Routing

 Dynamic Routing

  • Routing Approaches

 Distance Vectore

 Link State

  • Routing Protocols

 Autonomous Systems

 Interior Routing Protocols

 Exterior Routing Protocols

  • RIP
  • IGP

IANA

RIR

NIR

LIR

ISP

Host Host

ISP

Host Host

LIR

ISP

Host Host

ISP

Host Host

NIR

LIR ISP

Host Host

LIR ISP

Host Host

RIR

NIR

LIR

ISP

Host Host

ISP

Host Host

LIR

ISP

Host Host

ISP

Host Host

NIR

LIR ISP

Host Host

LIR ISP

Host Host docsity.com

Hierarchical allocation of ip addresses

Routing ..

• How routers know each other?

 Each router when boots up

 Finds the networks to which it is attached

 Broadcast this information to other routers

 All routers behaves the same way and they come to know each

other after some time

• How routes are selected?

 Routers calculates routing paths using

 Routing tables

 Routing algorithm

• What happens when a router becomes unavailable?

 Routers periodically broadcast a message to ensure their presence

 Absence of a message from a router is considered a failure

 All routers updates their routing tables and no more packet is sent

to such a router

Routing Overview

Router A Router C

Router B

N

N

N

N

N

Routing Table

Routing Table

Routing Table

Autonomous Systems

AS An ISP’s Network

AS PIEAS

AS PTCL

IRP and ERP

• IRP

 Interior Router Protocols  Passes routing information between routers within AS

 Customized routing protocols may be implemented

 Protocol does not need to be implemented outside the system  Provides detailed information about the system.

 Example

 RIP  Routing Information Protocol

ERP

 Exterior Router Protocol

 Routers on borders of AS uses ERP  ERP is used to provide summary information about AS routers

 Example

 EGRP  Exterior Gateway Routing Protocol

IRP and ERP…

Router with IRP and ERP both

Router with IRP and ERP both

Routing Approaches

• Static Routing

 Manual Configuration

 Routing updates are not possible

• Dynamic Routing

 Dynamic routing approaches are grouped as

 Distance Vector Routing

 Link State routing

 Both approaches uses different set of routing algorithm

Distance Vector Routing Protocols

• Routers gather information about directly attached networks

• Each router broadcast its routing tables

• Routing updates are periodic

 Each router broadcast its table after some specific period

 When a router receives an update from a router it starts a timer if

no update is received during this time the route is discarded

• Also called routing by rumor

 Routers broadcast information about the networks they are

directly attached along with network they heard form other routers

Distance Vector Routing…

  • After some period all router come to know each other

 This period is called Network Convergence Time

  • Distance between two networks is measured in terms of hop count

 Hop count  number of routers used

  • Routing decisions are based on hop count
  • Note:

 The network information is broadcasted only on directly connected networks

Example (2/5)

• Routers A, B and C broadcast their routing tables/distance vectors

• When A receives some information from B and it updates its routing

table

A B^ C

Network 1 Network 2 Network 3 Network 4

Destination Distance

Network1 0 Network2 0

Network3 1 B

Networks accessible from Router B

Destination Distance

Network2 0

Network3 0

Updated Table of Router A

Example (3/5)

• B receives broadcast from A it will add network1 accessible from A

• B also receives a broadcast from C, it will add network4 accessible

from C

Destination Distance

Network1 1 A

Network2 0

Network3 0

Destination Distance

Network1 1 A

Network2 0

Network3 0

Network4 1 C