# $!$ %&&' Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved

Transcription

1 A note on the use of these ppt slides: We e making these slides feely available to all (faculty, students, eades). They e in PowePoint fom so you can add, modify, and delete slides (including this one) and slide content to suit you needs. They obviously epesent a lot of wok on ou pat. In etun fo use, we only ask the following: If you use these slides (e.g., in a class) in substantially unalteed fom, that you mention thei souce (afte all, we d like people to use ou book!) If you post any slides in substantially unalteed fom on a www site, that you note that they ae adapted fom (o pehaps identical to) ou slides, and note ou copyight of this mateial.!" #! %&&' Thanks and enjoy! JFK/KWR All mateial copyight J.F Kuose and K.W. Ross, All Rights Reseved

2 ( ) m ) m *) m m +, m m ) -.)/! (! - %

3 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 0

4 * ) )!) )! ; * -.

5 8 * ) * 2 ( * * * * * m 4

6 -(* outing algoithm local fowading table heade value output link value in aiving packet s heade /

7 0 * m 3!*!<%4 (* *! ) ( ) m )) ) ) m ( + )) ) *1, m ( '

8 ) > # ) *?@ * )A B; ) * ) ) ) & B; ) * ** ) (* =

9 ) Netwok Achitectue Sevice Model Bandwidth Guaantees? Loss Ode Timing Congestion feedback Intenet ATM ATM ATM ATM best effot CBR VBR ABR UBR none constant ate guaanteed ate guaanteed minimum none no yes yes no no no yes yes yes yes no yes yes no no no (infeed via loss) no congestion no congestion yes no C

10 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 &

11 ) ) ) 1) ) )! ( m ) m ) m

12 1? m * m!*(* * 1*+, *! +(!(**, ( 1+ D( ), %

13 1 1 * * % 1 (! (* 0 *( (1 1 ( +, 1 (( m 1 ( * *( 0

14 8( 1 ( % % 0 %% 0% 8( * ( - *- 1 E 6 *6 1 E %0 %% %/0 = 0'% ' C'0 =' F F F F " * G

15 1! 1 3!*!< %4 2-4*( - /") 0 % 4

16 ( m )*?@ * m ( ** 7 %") /

17 8( ( ( Destination Addess Range Link Inteface though though though othewise 3 '

18 *; Pefix Match Link Inteface othewise 3 B; &&&&&&&&&&&&&&&&&&& # *A &&&&&&&&&&&&&&&&&&& # *A =

19 1 A -+, ; )! +, m!*!) m! ;?@ m ** m * )** 3 +1, ))* ) m!( H m * )? (@ m m ; C

20 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 %&

21 "6 )) * I+"-.!6 7.8!9:., * * %

22 -.8. ()!B 4 )! *( J 2 H* )* * *( %%

23 * *( %0

24 713 8 *.K 2 ( (+%(, Input Pot Memoy Output Pot System Bus %

25 719 * ) ( ( (( ( 0%:( (! 4/&& ** * %4

26 7 1 - ) ( ( 9! ) ) * *;! *( %&&& /&:( %/

27 6. 9** H )* *(* 7 H * %'

28 6 H (**)) ; H+, (**)*G %=

29 5 (**A "800C* ()(** " + %4&, m!d&: %4:( (** " *! (**H " %C

30 -.> 8( (LH H 5* +56,( H **H) H* )* H (**)*G 0&

31 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 0

32 - 5!*.!K. " M M"-.!6 7.8!9:. * ( -. M ) M * M) -3. M 0%

33 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 00

34 -. * -.) ( +(,?@ * ; ( +, ) ).A %&( *. %&( *-. D&( N ) ) /(* ) 0%( * ) * 0%( -. * ** 0%( -. +)(!. K., +(, * * I ( 6 +*, B!! * * ) 0

35 -.8 O" ( )3 K + ; * P, ()* m **! **3 K -. ) m ( ) m? (@ * m -.( *! * ( * 0 04

36 -.8 " ( B; &&&( 3 KD4&&( D&&& - D; ** D& ** D& 6 ( ) =&( * ** D =&I= D4&& D4&& D&& - D; - D; - D; ** D ** D ** D& ** D& ** D=4 ** D0'& 0/

37 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 0'

38 %( **! * * ( I m 2 ) * m * m -. * = =

39 7( -. m (+ (, m + (, # 2 (A m )* (*-. m ) ( *0 ( 0C

40 7( / /24 " (! **! * B ( /24 7( I% &

41 7( A

42 -. -" -" - " m (* *( m * (I;!; E ( (* ( %&&%0/&I%0 %

43 -. A > 5 -. A ( * m # LL* LIL m K -< II* 5. 5 *. * ) m?@ 0

44 5. 5 *. : ( -. * )Q * +?@ 7 * ( Q+, 5.)) m (?5. )@ m 5. )?5.**@ m H m 5. )?5.@

45 5. ) DHCP seve B aiving DHCP client needs addess in this netwok 4

46 5. ) 5. )%%0%4 DHCP discove sc : , 68 dest.: ,67 yiadd: tansaction ID: 654 ) DHCP equest DHCP offe sc: , 67 dest: , 68 yiadd: tansaction ID: 654 Lifetime: 3600 secs sc: , 68 dest:: , 67 yiadd: tansaction ID: 655 DHCP seve ID: Lifetime: 3600 secs DHCP ACK sc: , 67 dest: , 68 yiadd: tansaction ID: 655 DHCP seve ID: Lifetime: 3600 secs /

47 -. A > 5 (*-. A * )-7.2 ISP's block /20 Oganization /23 Oganization /23 Oganization / Oganization /23 '

48 5 5 **) * * 6 P& %&&%0/&I%0 6 P %&&%0=&I%0 6 P% %&&%0%&&I%0 6 P' 89-7.?7 ( %&&%0/&I%&@ - %&&%00&&I%0-7. "K?7 ( CC0&&I/@ =

49 5 * -7. "K *6 P 6 P& %&&%0/&I%0 6 P% %&&%0%&&I%0 6 P' 89-7.?7 ( %&&%0/&I%&@ - %&&%00&&I%0 6 P %&&%0=&I%0-7. "K?7 (CC0&&I/ %&&%0=&I%0@ C

50 -. > 5-7.(* A --* ( m m 7 m! ) 4&

51 * - 0='/%C' &&& +!, &&&I% &&& &&&% &&&0 ) ) -. 0='/%C'! ** ( )&&&I% *! +, 4

52 3 ) Q -. * m * * -7.Q -. *) m *) * m -7. * ) m ) ; (! ) (( +, 4%

53 - m + -.! E,*) + -.! E, I ) + -.!E, m (+ (,)+ -.!E,+ -.!E, m + -.! E, * *) + -.!E, ( 40

54 % * &&&!004 0='/%C'!4&&! ( % ( # 0='/%C'!4&&&&&!004 FF FF 70='/%C'!4&& %=C&=/!=& &&& 7 &&&!004 %=C&=/!=& &&& %=C&=/!=& &&& &&&% 0='/%C' 7 %=C&=/!=& 0='/%C'!4&& 0 0 ") 0='/%C'!4&& 7 %=C&=/!=& &&&!004 &&&0 * 0='/%C'!4&&&&&!004 4

55 /( (* m /&!&&& G ) m 0 m ) M ( ((!!.%. m ( )( -.)/ 44

56 ) ( ) &&& m ) &&& +2, m ;) ( 0='/%C' * * H ) ) m!+%0'/%c'!%4&&, *&&& %4&&& A 0='/%C' &&& &&& 4/

57 ) ( %K)..+K..,-: )+-:,. (-. +0='/%C', ; I ) +, 0='/%C' -: &&& &&&! * 4'

58 ) ( 0+ 7, m ) ( m B; m ( ( % ( 0 ( ( 0='/%C' &&& 4=

59 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 4C

60 ( O ) * m (!!! m H I+ (,?()@ -. m ! * =( *-. Type Code desciption 0 0 echo eply (ping) 3 0 dest. netwok uneachable 3 1 dest host uneachable 3 2 dest potocol uneachable 3 3 dest pot uneachable 3 6 dest netwok unknown 3 7 dest host unknown 4 0 souce quench (congestion contol - not used) 8 0 echo equest (ping) 9 0 oute advetisement 10 0 oute discovey 11 0 TTL expied 12 0 bad IP heade /&

61 -3. 7 * K. m 8 D m 7 D%! m K ( # ) m " m -3. +! &, m 3 * O-. # -3. )! " 0 7 K. ) ) -3.? (@ +0!0, # -3.! /

62 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 /%

63 -.)/ - ) 0%( ( ) m * I* m *> 7 -.)/ * m *;&( m * /0

64 -.)/5+,. * * 8 ( *?*@ +*?*@ *, ; ** /

65 6 * -.) ) 6!( *! (?;5@ * -3.)/ ) *-3. m!?. 9@ m * /4

66 8 -.)-.)/ ( m 5 ;-.) -.)/ A -.)/ -.) -.) //

67 ) 9 B 8 -.)/ -.)/ -.)/ -.)/. ) 9 B 8 -.)/ -.)/ -.)/ -.)/ -.) -.) /'

68 ) 9 B 8 -.)/ -.)/ -.)/ -.)/. ) 9 B 8 -.)/ -.)/ -.) -.) -.)/ -.)/ 8< B 8< B 8< 7 8 8< )/ 9 -.)/ -.) 9 -.)/ -.) B8 -.)/ /=

69 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 /C

70 -(!* outing algoithm local fowading table heade value output link value in aiving packet s heade '&

71 :( 4 Gaph: G = (N,E) % ) ; % % P N = set of outes = { u, v, w, x, y, z } E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) } " :( *; B;.%.! * B *. '

72 :( % 4 ) ; % % P M +;!;2,D *+;!;2,!+!P,D4 M (! ) (! ) *+;!; %!; 0!F!;,D+;!; %,N+; %!; 0,NF N+;!;, > # 2 (PA " * '%

73 " * :(P * A :( )! P (! ( ) *!;* *(? )@ 7 A 7 ) H m m '0

74 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 '

75 7" Q 2! m )? m ) * * m ) *( * )*! 2 c(x,y): * ;RD * ( D(v): )* ** ) p(v): * ) N': * *) '4

76 Q 2 1 Initialization: 2 N'= {u} 3 fo all nodes v 4 if v adjacent to u 5 then D(v) = c(u,v) 6 else D(v) = 7 8 Loop 9 find w not in N'such that D(w) is a minimum 10 add w to N' 11 update D(v) fo all v adjacent to w and not in N': 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is eithe old cost to v o known 14 shotest path cost to w plus cost fom w to v */ 15 until all nodes in N' '/

77 Q 2 ; Step N' u ux uxy uxyv uxyvw uxyvwz D(v),p(v) 2,u 2,u 2,u D(w),p(w) 5,u 4,x 3,y 3,y D(x),p(x) 1,u D(y),p(y) 2,x D(z),p(z) 4,y 4,y 4,y 4 % ) ; % % P ''

78 Q 2 ; +%, " * ) P ; " *( ) ; P +!), +!;, +!;, +!;, +!;, '=

79 Q 2! ;!! +N,I% 6 + %, ** (6 +, 6 (! D *** & & & N 9 %N & N & & 9 F & %N & & N 9 F %N & N & F 9 'C

80 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 =&

81 1 9 8BH+, * ; +,D * * ; ; +,D S+;!),N ) +,T ) )( )*; =

82 9 8; % 4 ) ; % % P! ) +P,D4! ; +P,D0! +P,D0 98H +P,D S+!),N ) +P,! +!;,N ; +P,! +!,N +P,T D S%N4! N0! 4N0TD ) ; *( =%

83 1 ; +, D * * ; ; () +;!), ; ) ; D U ; +,V W ; ( 2 ) m 8()!; ) DU ) +,V W =0

84 ) +, 9 B ) ( # ;) 1 * (! 1 98H ; +, ) S+;!),N ) +,T* K!! ; +,) ; +, =

85 1 +4, -)! ( 1 * ( ( * ( 1 m ( * ( * B wait fo (change in local link cost o msg fom neighbo) ecompute estimates if DV to any dest has changed, notify neighbos =4

86 ; +,D S+;!,N +,!+;!P,N P +,T D S%N&!'NTD% ;P ;P ; &%' P ;P * ; %& P ;P * * ; P ' & * ; P & % 0 %& '& ; +P,D S+;!,N +P,!+;!P,N P +P,T D S%N!'N&TD0 % ; P ' =/

87 ; +,D S+;!,N +,!+;!P,N P +,T D S%N&!'NTD% ;P ;P ;P ; &%' ; &%0 ; &%0 %& %& P P '& P 0& ;P ;P ;P ; ; &%' ; &%0 %& %& %& P P '& P 0& ;P ;P ;P * * * ; P ' & * * * ; P &%' %& 0& * * * ; P &%0 %& 0& ; +P,D S+;!,N +P,!+;!P,N P +P,T D S%N!'N&TD0 % ; P ' ='

88 1 *! ) *1!*( ; P 4&? ) &!! 1! * (!P ) * ( - ; ( 1 %! ) P2 ( 2 P ==

89 1 ) * ( )?*@ ( G (* (P ;. ) -*X Y < m X Y +X 2, < *+ Y2 < )X, ) *( A /& ; P 4& =C

90 * 71 3 ; 7!B! 6 +B, 1 ;( ( m ) ) 7 *) 7 6 +, H 6 +B, m ) 1) ) m ( m *( "( * * A 7 1 m ) m ( m 1) m 2 ( ( M C&

91 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 C

92 5" 6 * P?*@ F %&& 2 2 ( G (; G ) D* C%

93 +7, 7 m?7@ m **7 ** 7 : 7 C0

94 ( 70 ( Inta-AS Routing algoithm 7 Fowading table Inte-AS Routing algoithm % % 7% %( *( *(( 7 m 7 * m 7 O - * ; C

95 -7 7 ) *7 m *!( A 7 ( 7%! 70 % (* 7 (*7 G 0 0 0( 70 ( 7 % % 7% %( C4

96 B; 7 *( 7 +)7, ( ; ()7 0+,()7% 7 (* * 7 * *- m *(+;!-, 0 0 0( 70 F ; ( 7 % % %( 7% C/

97 B; 7 7 * 7 (; (* 7 0 * 7% **(! * * ; m Q(*7 G 0 0 0( 70 F ; ( F 7 % % 7% %( C'

98 B; 7 7 * 7 (; (* 7 0 * 7% **(! * * ; m Q(*7 G * Lean fom inte-as potocol that subnet x is eachable via multiple gateways Use outing info fom inta-as potocol to detemine costs of least-cost paths to each of the gateways Hot potato outing: Choose the gateway that has the smallest least cost Detemine fom fowading table the inteface I that leads to least-cost gateway. Ente (x,i) in fowading table C=

99 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 CC

100 -7" -:. +-:., -7 m "-."-*. m m -:".-:".+, &&

101 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 &

102 "-.+"-*., ) 97 K -< (C=% E * + ;D4, 8 ( P ) 9 ; )% % ;0 0 P% &%

103 "-.) ) ; ( )0& )" 3 + ), ) *%4 7 &0

104 "-.B; ; 9 P!! " # # "( &

105 "-.B;! "! " %& # # ' ; 9 P!! " # # "( &4

106 "-. 8") -*) *=& L (I m )() m ) ( m ( ) +* (, m **H+A, m ) ) +* D/, &/

107 "-.( "-.( (!' +, ) K.! +K., * +-.,( * ( +K., +-., &'

108 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 &=

109 m 7 m m Q ) ( ) 7 +) *, m )-.+. K. &C

110 6 * +"-., ), + "-., 8! *** 6 7+!?@ *( **R *, m , ( &

111 56 7.8

112 )!(( m ) m R +, (? P@!) 9 (( (( ( 72 %

113 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 0

114 -79:. 9:.+9:., * 9:.) 7 6 ( ((* * (7 %.(* 7 0?@ ( ( (* () ;

115 9:.( * +9:.,;* ). 9:. m 9:. 7%) *;7 m 7% * *; m 7%*; ) 0 0 0( :. 9:. ( % % 7% %( 4

116 ((* 9:. (0!70 *;(*7 m 9:. (*; * 7 m () (* 7%)(%9:. **;! **; *( 0 0 0( :. 9:. ( % % 7% %( /

117 .( O9:. ) *; 9:.( m *;N( D?@ ( m *; )!7 /'!7 ' m B< 56. *7 ;7 + ( * 7 ;7, ) )! I '

118 9:. ( *;" *)( % B< 56. =

119 9:. 9:. ;. 9:. m 6.B. m K. B ) +, m BB. -1 B )( * K.B7R 6.BH m ) R C

120 9:. 9 : ) ( % ) *!9!) <!#!Y +*), < m < * 9)< m <) 9 %&

121 9:.+%, 9 : ) ( % ) * ) # 9 9) 9# < 7 9) 9# A m G9?)@ *9# # 92 m 9 *) m 9 I* G %

122 # **- -7 A. -7 ) **! -7! 7 ) ( P! **.* -7 * * -7 )* %%

123 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 %0

124 9 " ) * ** duplicate " duplicate ceation/tansmission " "% "% duplicate "0 " "0 " souce duplication in-netwok duplication A %

125 - *) (! ( m.( O( *( * 2( (* m * ( m 6 ) *+".8,* *) ( m )( %4

126 7 8 * B 8 B (a) Boadcast initiated at A : (b) Boadcast initiated at D : %/

127 7 B Q m 3 *) ( B B : : (a) Stepwise constuction of spanning tee (b) Constucted spanning tee %'

128 3 ".( 7 +,*+, ) ( m ( m ( *** ) m ( ( 7 7(

129 *( ( m m ) * m +7, m ( F* (! *

130 7. ** * ) m Q 2 7 " % " "% 4 0 "0 / "/ "' "4 B:B ( ( **! (

131 ").8 2 * * *() + ) (, *

132 ").8; 7 "% " " "4 B:B ( ( "0 "/ "' ( * ( * M *) 7. Z ((

133 ").8 * ( ( m * ( m?@ ( ( 7 B:B " " ( "0 "%.. "/ "' "4. ( *

134 7 7 7 ( (. ; ; m ; m * ( m ) QI)

135 ( ) ( *?@ * Q m Q m ( * m Q ; (*!) m (Q ( (* *

136 ( ; 7 "/ B:B " 0 " ( "0 "% % "/ "' "4 ( Q

137 -3 "1 3 ". 1 3 ". )!"8&'4 * ) *! ( m ".8( 1 3 ".2 ( ( 1 3 ". m ( m * ))".8 m

138 13 ".F * 1 3 ( m * ( m ) H* m *-:3.Q* m m 3 ( 1 3 ".

139 -, * +, -.?@ )-. ) )

140 * +, ** ( ; ( * 7 E ( E (*

141 H *7 ( ( ; ) +!".8, ( * 7 ( ;Q ) ) * +!(, ( ))

142 .-3 3 *".8! 1 3 ".( ) ".8* * + **, *1 3 ". * *

143 ( Q P) +"., " Q " m *Q *Q)".! * m *! "0 "% Q * P) "/ Q "4 "' P)

144 , ".! ( ". " Q " ".; ". * ) m? G@ "0 "% Q * P) "/ Q "4 "' P)

145 - 4" %1 0# m * m -.) m -3. m -.)/ m m 1 m 5 /" - m "-. m m 9:. '9 4