Destination Sequenced Distance Vector (DSDV) and Dynamic Source Routing (DSR) Protocols, Study notes of Computer Science

An overview of two routing protocols, destination sequenced distance vector (dsdv) and dynamic source routing (dsr). Dsdv is based on bellman-ford algorithm and uses a sequence number to prevent routing loops. Dsr, on the other hand, proposes a path computation through flooding and packet forwarding via source routing. The document also discusses the challenges and solutions related to these protocols, such as fluctuating routes and route reply explosion.

Typology: Study notes

Pre 2010

Uploaded on 08/18/2009

koofers-user-q6h
koofers-user-q6h 🇺🇸

9 documents

1 / 27

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
120
Destination Sequenced Distance Vector
(DSDV)
Based on Bellman-ford algorithm with the following
changes:
Each routing table entry keeps (destination, next-hop, hop-count,
seq, install time), seq is assigned by a destination node
001200D-5024BD
001500C-9203BC
001200B-4701BB
001000A-8460AA
Install TimeSeq. NoMetricNext HopDestination
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b

Partial preview of the text

Download Destination Sequenced Distance Vector (DSDV) and Dynamic Source Routing (DSR) Protocols and more Study notes Computer Science in PDF only on Docsity!

Destination Sequenced Distance Vector(DSDV) „^

Based on Bellman-ford algorithm with the followingchanges:^

Each routing table entry keeps (destination, next-hop, hop-count,seq, install time), seq is assigned by a destination node

001200

D-

4

B

D

001500

C-

3

B

C

001200

B-

1

B

B

001000

A-

0

A

A

Install Time

Seq. No

Metric

Next Hop

Destination

DSDV (Cont’d) „^

Route updates^

Periodic (infrequent) full-dump of all routing table entries

Incremental updates for information which has changed sincelast full dump

Upon reception of a route update, a node compare the sequencenumber

„^

If larger than mine, update the corresponding entry „^

If same, update only if with a better route „^

If less, discard the message

DSDV (cont’d)

R

4

R

3

R

2

R

1

Consider the calculation of distances to R

1,R

, S3 4

2,R

,S3 3

3,R

, S3 2

1,R

, S3 4

2,R

,S3 3

, -, S

1,R

, S3 4

, -, S

, -, S

, -, S

, -, S

, -, S

R^3

R

2

R^1

Time

R

3

R

4

connected

Fluctuating Routes

„^

MH

broadcasts update 9

information to MH Collections Iand II

„^

MH

4

can received updates from

MH

and MH 2

6

„^

MH

4

broadcasts its update twice

„^

Solution:^

Delay the broadcast of a routingupdate with settling time,however, broken links areupdated immediately

Mobile HostCollection I

Mobile HostCollection II MH

9

MH

6

MH

2

MH

4

A

B

C

E

D

G

H

F

A

A

A-B A-C

A-C-E

A-C-E

A-C-E

A-B-D

A-B-D-G

A-B-D-G

A-B-D-G

Route Discovery

A-B-C A-B-C

Route Request (RREQ)Route Reply (RREP)

Route Discovery is issued with exponential back-off intervals.

Initiator IDInitiator seq#Target IDPartial route

RREQ FORMAT

Route Discovery: at source A

A need to send to G Lookup Cache for route A to G

Routefound?

Start RouteDiscoveryProtocol

Continuenormalprocessin

g

Route Discoveryfinished

Packet

in buffer?

Send packet tonext-hop

done

Bufferpacket

no

Write route inpacket header

yes

yes

no

wait

A

B

C

E

D

G

H

F

G

RERR

RERR

Route Cache (A)G: A, B, D, G G:A, C, E, H, G

Route Maintenance

Additional feature #1: Caching Overheard Routes

A^

B^

C^

D^

E

V^

W

X^

Y^

Z

Node A CacheE: A, B, C, D, E

Node C CacheE: C, D, EE: C, D, E

A: C,

E: C, D, EB, A

A: C,

B, A

Z: C, X, Y,

Z^

V: C, X, W, V

Potential Problem „^

Route Reply Explosion

„^

Solution:^

Delayed transmission

Additional feature #3: RREP with Cached Routes

A

B

C

E

D

H

F

G

RERR

RERR

Route Cache (A)G: A, B, D, G

Route Cache (C)G: C, E, D, G

RREQ(! D-G) RREQ(! D-G)

RREQ(! D-G)

Ad Hoc On-demand Distance VectorRouting Protocol (AODV) „^

Reactive routing protocol

„^

A distance-vector protocol^

Routing table in every node contains the next hop along the pathtowards the destination

„^

Neighbors are discovered with Hello messages^

Local connectivity

Routing Table EntriesInformation stored for an active route: „^

Destination

„^

Next Hop

„^

Number of Hops to Destination

„^

Destination Sequence Number

„^

Active Neighbors for this Route

„^

Expiration Time for Route

Path Discovery „^

A Route Request (RREQ) packet is issued when nonode contains route information for a requireddestination

„^

RREQ packets are flooded in the network^

Duplicate receptions are discarded

Hop Count is incremented every hop

RREQ Fields „^

Source Address

„^

Source Sequence Number^

The current sequence number of the originating node

„^

Broadcast ID^

Uniquely identifies a packet in the network

„^

Destination Address

„^

Destination Sequence Number^

The latest sequence number received by the originator for anyroute towards the destination

„^

Hop Count