Routing Algorithm - PowerPoint PPT Presentation

1 / 30
About This Presentation
Title:

Routing Algorithm

Description:

Routing Algorithm. 2004. 11. 3. Ahn Kook Jin. Contents. Routing ... Poisoned. reverse. Cannot solve general count-to-infinity problem. Y. X. Z. 50. 4. 1. 51. 60 ... – PowerPoint PPT presentation

Number of Views:44
Avg rating:3.0/5.0
Slides: 31
Provided by: cosmosK
Category:

less

Transcript and Presenter's Notes

Title: Routing Algorithm


1
Routing Algorithm
  • 2004. 11. 3
  • Ahn Kook Jin

2
Contents
  • Routing Protocol and Algorithm
  • Classifications
  • Link State Routing Algorithm
  • Distance Vector Routing Algorithm
  • LS Algorithm vs. DV Algorithm
  • Hierarchical Routing

3
Routing Protocol and Algorithm
  • Determining the path(route)

destination host
source host
4
Classifications
  • Global vs. decentralized
  • global(link state algorithm) complete
    information about connectivity and link costs
  • Static vs. dynamic
  • static routes change very slowly
  • Load-sensitive vs. load-insensitive
  • load-sensitive link costs reflect congestion
  • Typical used
  • Dynamic link state routing algorithm
  • Dynamic distance vector routing algorithm

5
Link State Routing Algorithm
  • Each node broadcasts the identities and costs to
    its directly attached neighbors
  • Dijkstras algorithm

6
Link State Routing Algorithm
  • Oscillation(page 307)

7
Distance Vector Routing Algorithm
  • Iterative, asynchronous, distributed
  • Distance table
  • DX(Y,Z) cost of the direct link from X to Z
    Zs currently known minmum-cost path to Y
  • DX(Y,Z)c(X,Z)minwDz(Y,w)

8
Distance Vector Routing Algorithm
  • Initialization
  • DX(,v) inifinite, DX(v,v)c(x,v)
  • Send minwDX(y,w) to each neighbor when they
    changes
  • C(X,V) changes
  • Neighbor node send its update

9
Distance Vector Routing Algorithm
2
1
7
10
Distance Vector Routing Algorithm
2
1
7
11
Distance Vector Routing Algorithm
2
1
7
12
Distance Vector Routing Algorithm
  • Decrease

4
1
1
50
13
Distance Vector Routing Algorithm
  • Decrease

4
1
1
50
14
Distance Vector Routing Algorithm
  • Decrease

4
1
1
50
15
Distance Vector Routing Algorithm
  • Decrease

4
1
1
50
16
Distance Vector Routing Algorithm
  • Increase

4
1
60
50
17
Distance Vector Routing Algorithm
  • Increase

4
1
60
Routing loop
50
18
Distance Vector Routing Algorithm
  • Increase

4
1
60
50
19
Distance Vector Routing Algorithm
  • Increase

4
1
60
50
20
Distance Vector Routing Algorithm
  • Increase

4
1
60
Too many iterations! (count-to-infinity problem)
50
21
Distance Vector Routing Algorithm
  • Poisoned reverse

4
1
60
50
22
Distance Vector Routing Algorithm
  • Poisoned reverse

4
1
60
50
23
Distance Vector Routing Algorithm
  • Poisoned reverse

4
1
60
50
24
Distance Vector Routing Algorithm
  • Poisoned reverse

4
1
60
50
25
Distance Vector Routing Algorithm
  • Poisoned reverse
  • Cannot solve general count-to-infinity problem

4
1
60
50
26
LS Algorithm vs. DV Algorithm
27
Hierarchical Routing
  • View network as interconnected routers
  • Scale
  • Administrative autonomy
  • Organize routers into autonomy systems(AS)

28
Hierarchical Routing
Autonomy system(AS)Gateway routerIntra-ASInter-
AS
29
Hierarchical Routing
Topological view for inter-AS routing protocol
30
END
Write a Comment
User Comments (0)
About PowerShow.com