???

1
???µ?????s? (Routing)

2
?e??????

• Flooding
• ? ???? t?? ???t?st?? ?a? ???aµ????
  ?????aµµat?sµ??
• Dijkstras Algorithm
• ???????µ?i ???µ?????s??
• Link State
• Distance Vector
• ???µ?????s? se ????t? ???t?a
• ???µ?????s? se ad hoc d??t?a

3
???µ?????s? d?a ???µµ??a? (Flooding)

• ???e pa??t? ap?st???eta? se ??e? t?? ?ate????se??
  e?t?? ap? t?? ?ate????s? ap ?p?? ???e.
• ???s?µ?p??e?ta? ?p?? e?daµe st?? ??f??e? (se
  ep?ped? ?e???? ded?µ????)
• ???? e???st?? (se pe??pt?s? p?? p?????
  d??µ?????t?? staµat?s??? ?a ?e?t???????
  ta?t?????? p.?. se p??eµ???? ep??e???se??)
• ?? ap?d?t???? af?? d?µ?????e? p???? a??e?asta
  pa??ta.
• ?a????? asfa?e??, af?? st???e? p????f???e? se
  ??µß??? p?? de? ??e???eta? ? de? p??pe? ?a t??
  d???.

4
???? t?? ???t?st?? (Optimality Principle)
??a ? ß??t?st? d?ad??µ? E?J?
5
?et????? ?p?d?s??

• ? a??????µ?? d??µ?????s?? s??p? ??e? ?a
  e?a??st?p???se? µ?a µet????
• ????µ?? s??d?se?? (number of hops)
• F?s??? ap?stas? (Km)
• ??s? ?a??st???s?

6
???ß??µa ?????st?? ?p?stas??
???ste t? µ???p?t? µe t? µ????te?? ??st?? ap? A
st? H (?p??es? se ???e ß?µa de? µp????µe ?a
???????µe p??? ta p?s?)
7
???ß??µa ?????st?? ?p?stas??
???ste t? µ???p?t? µe t? µ????te?? ??st?? ap? A
st? H
8
???ß??µa ?????st?? ?p?stas??(Dijkstras
algorithm)

• ?????? ???? ?? ??µß?? e??a? µ? ?ata????µ????
• ??????µe t?? pa?a??pt? (? ap?st???a) sa? e?e???
  ??µß? (working node)
• ??? s?µade???µe µe t? ??st?? µ???? t?? pa?a??pt?
  (? ap?st???a)
• ?p????????µe t? ??st?? ??a ????? t??? ??µß??? p??
  e??a? s??dedeµ???? µe t?? e?e??? ??µß?.
• ?p??????µe (ap? t??? µ? ?ata????µ????? ??µß???)
  t?? ??µß? µe t? µ????te?? ??st??, t?? ?ata?????µe
  ?a? t?? ???µ????µe sa? t?? ??? e?e??? ??µß?.
• ?p????????µe t? ??st?? ??a ????? t??? ??µß??? p??
  e??a? s??dedeµ???? µe t?? e?e??? ??µß?
• ?pa?a?aµß????µe t? te?e?ta?? ß?µa µ???? ?a
  ?ata????s??µe ????? t??? ??µß???.

9
???ß??µa ?????st?? ?p?stas??(Dijkstras
algorithm)
???ste t? µ???p?t? µe t? µ????te?? ??st?? ap? A
st? H
10
???ß??µa ?????st?? ?p?stas??(Dijkstras
algorithm)
B C D E F G H
A








11
???????µ?? Distance Vector

• ?ata?eµ?µ???? a??????µ?? Bellman-Ford ?a?
  Ford-Fulkerson
• ? ???e d??µ?????t?? d?at??e? ??a d????sµa µe t??
  ap?stas? ap? ???e ??µß? st? d??t??.
• G?a ???e p?????sµ? d?at??e? ep?s?? t?? a???ß??
  ep?µe?? ??µß? st? ?p??? p??pe? ?a sta?e? t?
  pa??t?.
• ?p???t??µe p?? ???e d??µ?????t?? µp??e? ?a
  e?t?µ?se? t?? ap?stas? se ????? t???
  ?e?t??????? ??µß???.

12
???????µ?? Distance Vector

• ?ta? ??a? d??µ?????t?? j pa?a??ße? t? d????sµa
  ap? t?? ?e?t????? d??µ?????t? k t?te
• G?a ???e p?????sµ? ?p??????e? t? ?????sµa t??
  ap?stas? ap? t? ?e?t????? ??µß? k s?? t??
  ap?stas? ap? t?? ?e?t????? ??µß? µ???? t??
  p?????sµ?.
• ??? t? ?????sµa e??a? µe?a??te?? ap? t?? ap?stas?
  p?? ? j ??e? st? d??? t?? d????sµa, t? a???e?.
• ??? e??a? µ????te??, t?te ap?fas??e? ?t? e??a?
  p?? ap?d?t??? ?a ap?st???e? ta pa??ta t?? µ?s?
  t?? ?e?t?????? ??µß?? k.

13
Distance Vector Algorithm
As Routing Table As Routing Table As Routing Table
Dest Cost Next
A 0
B 3 B
C 2 C
D 3 C
E 8 C
Bs Routing Table Bs Routing Table Bs Routing Table
Dest Cost Next
A 3 A
B 0
C 3 D
D 2 D
E 7 D
14
Distance Vector Algorithm
Ds Routing Table Ds Routing Table Ds Routing Table
Dest Cost Next
A 7 B
B 1 B
C 8 C
D 0
E 2 B
Bs Routing Table Bs Routing Table Bs Routing Table
Dest Cost Next
A 6 A
B 0
C 7 D
D 1 D
E 1 E
As Routing Table As Routing Table As Routing Table
Dest Cost Next
A 0
B 6 B
C 9 C
D 7 B
E 7 B
15
???????µ?? Link State

• ?p?fe??e? t? p??ß??µa t?? s?????s?? af??
  ???s?µ?p??e? ??? µ??? t?p???? p????f???e? a???
  ?a? t?? t?p?????a ???? t?? d??t???.
• ????a ?a?a?t???st??? t?? Link State
• ???e ??µß?? a?a?a??pte? t??? ?e?t??e? t??
• ??t?µ? t?? ap?stas? ap? t?? ???e ?e?t??a
• St???e? ??e? t?? p????f???e? p?? ??????e? se
  ????? t??? ??µß???

16
?a??ta Link State
17
??a??µ? t?? ?a??t?? Link State

• Se ???e pa??t? ?p???e? a???? a???µ?? (seq), t??
  ?p??? a????e? ?at? ??a ? d??µ?????t?? ? ?p????
  d?µ?????e? ta pa??ta.
• ? a???? a???µ?? f????eta? ep?s?? se ????? t???
  d??µ?????t??.
• ?p?te ??a? d??µ?????t?? pa?a??ße? ??a ??? pa??t?
  Link State ?????e? t?? ????? a???µ? t??
• ??? e??a? µe?a??te??? ap? a?t?? p?? ??e? ?d?
  ?ata??aµµ???, ?ata???fe? t? pa??t? ?a? t?
  d?a??µe? se ??e? t?? ?e??e?? e?t?? ap? e?e??? ap?
  t?? ?p??a ???e.

18
???ß??µata st? ??a??µ? t?? ?a??t?? Link State

• ??a? d??µ?????t?? ap?s??d?eta? ?a? st? s????e?a
  epa?as??d?eta? µe ap?t??esµa ? a???? a???µ??
  (seq) ?a µ?de??ste?.
• ???? ??p???? sf??µat?? st? µet?d?s? ? a????
  a???µ?? p??e t?µ? µe?a??te?? ap? t?? a?aµe??µe??.
• ??s? ???s? e??? ?????µ?t??? (age) t? ?p??? µet??
  t?? ?????a ???e p????f???a?. ?ta? t? ?????µet??
  ft?se? st? µ?d??, t?te ?? p????f???e? pa???? ?a
  ?s?????.
• ?p?p??s?et? ?sf??e?a
• ?ta? ??a? d??µ?????t?? p??e? ??a pa??t? Link
  State, t?te de? t? d?a??µe? aµ?s?? a??? t?
  ap????e?e? ?a? ?a??ste?e? ???? p??? t? ste??e?.

19
?e?a????? ???µ?????s? (Hierarchical Routing)

• G?a µe???a d??t?a, ?? p??a?e? d??µ?????s?? µp??e?
  ?a ????? te??st??? µe ap?t??esµa ?a ??e?????ta?
  ?pe?ß????? µ??µ? ?a? ? a?a??t?s? st??? p??a?e? ?a
  e??a? µ? ap?d?t???.

D L C
1a - -
1b 1b 1
1c 1c 1
2a 1c 3
2b 1c 2
2c 1c 3


5d 1c 5
20
?e?a????? ???µ?????s?
Region 2
Region 1

• ?p?t?????eta? µe??s? st? µ??e??? t?? p??a?a
  d??µ?????s??
• ? d??µ?????s? de? e??a? ß??t?st?

21
?et?d?s? µe ????ap???? ?a?a??pte?

• Broadcasting ?et?d?s? p?? ape????eta? se
  ???????? t? d??t??
• Multicasting ?et?d?s? p?? ape????eta? se ?µ?de?
  pa?a??pt??

22
Broadcasting

• ?p?st??? a?t???af?? t?? pa??t?? se ????? t???
  pa?a??pte? (p??? ?a?? ??s?).
• ?? ap?d?t???. ?p?s?? ??a? ??µß?? µp??e? ?a µ??
  ??????e? ????? t??? pa?a??pte?.
• Multi-destination routing
• ??a pa??t? ??e? p????? d?e????se??. ?
  d??µ?????t?? st???e? ??a a?t???af? se ???e ???d?
  t?? ?p??a ?st? ?a? ??a? pa?a??pt?? ???s?µ?p??e?
  sa? ß??t?st? d?ad??µ?
• ???? ? ap?st???a? p??pe? ?a ???e? ??e? t??
  d?e????se??
• ???t?? ?p???????? (Spanning Tree)
• ???e d??µ?????t?? a?aµetad?de? ta pa??ta µ???
  st?? e??d??? p?? a?????? st? d??t?? ep????????.

23
Broadcasting

• Reverse Path Forwarding
• ? d??µ?????t?? d?aß??e? t? d?e????s? t??
  ap?st???a ?a? s??????e? t?? ?e??? ap? t?? ?p??a
  ?ftase t? pa??t? µe a?t? p?? ?a ???s?µ?p???se? ?a
  ste??e? pa??ta st?? ap?st???a (p??a?a?
  d??µ?????s??).
• ??? e??a? ?d?e?, t?te ?p???te? p?? t? pa??t?
  e??a? ???, ?p?ta? t? p????e? se ??e? t?? ?e??e??,
  e?t?? ap? a?t?? st?? ?p??a ?ftase t? pa??t?.
• ?d??t?te? t?? ???????µ??
• ???p??e? t?? a??????µ? ???t??? ?p???????? ?????
  ?a ??e???eta? ?a ?t?se? t? d??t?? ep????????!
• ? a??????µ?? ?p???te? s?µµet???? d??µ?????s? (??
  µ???p?t? ap? ? st? ? e??a? t? ?d?? µe ? st? ?).

24
Multicasting

• ???t?????a ??a ?µ?de? ap? ???ste? (p.?.,
  ?ata?eµ?µ??e? ß?se?? ded?µ????)
• ??a?e???s? ?µ?d??
• ???p?? µe t? ?p??? ???ste? e?t?ss??ta? ?a?
  d?a???f??ta? ap? ?µ?de?.
• ???a? s?µa?t??? ?p?? ?? d??µ?????t?? ?????? ta
  µ??? ???e ?µ?da? ??a ?a d?e?pe?a??s??? t?
  d??µ?????s?
• ??te ta µ??? p????f????? t??? d??µ?????t??
• ??te ?? d??µ?????t?? pe???d??? ??t??? ap? ta µ???

25
Multicast Routing

• ???f???? a??????µ??.
• ??adeµ??a ???t?a ?p???????? (Spanning trees with
  pruning).

26
Multicast Routing
27
???µ?????s? se ????t? ???t?a

• ???e ???st?? e??a? ?ata????µ???? se µ?a a?????
  pe????? (home location).
• ???e pe????? ??e? p???t??e? ?? ?p????
  d?a?e??????ta? t??? t?p??? ?ata????µ????? ???ste?
  (home agent) ? t??? ep?s??pte? (foreign agents)
• ???e f??? p?? ??a? ???st?? µpa??e? se ????
  pe?????, e??µe???e? t?? foreign agent t??
  pe?????? µ?s? µ?a? d?ad??as?a? e???af??
  (registration procedure).

28
??ad??as?a ????af??

• ???e foreign agent pe???d??? a?a??????e? t??
  ?pa??? t?? ?a??? ?a? t? d?e????s? t??
• ????? ??a? ????t?? ???st?? µpe? se µ?a ??a
  pe?????, e?te pe??µ??e? ?a a???se? t?? foreign
  agent, e?te e?p?µpe? ??p??? µ???µa ?t? a?a??t?
  t?? foreign agent.
• ? ????t?? ???st?? e????feta? µe t?? e? ????
  Foreign Agent d????ta? t??
• ? foreign agent e??µe???e? t?? Home agent t??
  ????t?? ???st?
• ? home agent st???e? epa???e?s? st?? foreign
  agent ?a? ? te?e?ta??? ?????????e? t?? e???af?
  e??µe?????ta? t?? ????t? ???st?.

29
??ad??as?a ?p????????a? µe ????t? ???st?
30
MANET (Mobile Ad Hoc NETworks)

• ???t?a ????? sta?e?? ?p?d?µ?
• ?e? ?p???e? sta?e?? t?p?????a
• ?e? ?p?????? sta?e??? ? ???st?? ?e?t??e?
• ? d?e????s? IP de? ??e? ?aµ?? s??s? µe t??
  t?p?????a
• ?e??ss?te?a ep? t?? ??µat?? A. Tanenbaum