! "# $ $ %&&' Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved 5: DataLink Layer 5-1
|
|
|
- Marylou Blankenship
- 5 years ago
- Views:
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 5: DataLink Laye 5-1
2 ( $ $)$$ * m m )$$$ m $$ m $)$+ +$ $, $+*$ $$ 5: DataLink Laye 5-2
3 -. * %/ 01 $$ $ "$ / 2"$ ' *$ : DataLink Laye 5-3
4 . 6$ $ 7$ m $ m $$ m $"% $ )$+ ++ 7*$ 5: DataLink Laye 5-4
5 $8 +) ++$$ *++$ m /+$ +$ $ 4&%-- $$ $$ *++ * m * *$ $ +3 m $3 9 m $ 9:* m :* ; ; $ ; $$$ *$; $ 5: DataLink Laye 5-5
6 6* + $ m $+ $ m $+ m <1 = ++ > +++.3, $)$$*) 7 m $ $?0@, m $$ m $$ > A )$"$*$"$)$B 5: DataLink Laye 5-6
7 +$ $ m ) 7* m )$ m *+ > $++ m *+ )?@ $+"$8+$$"$8 m $+$8 )+$ ) 5: DataLink Laye 5-7
8 # $$$B * $$$ <=? +.@ m / 31. 4&%-- application tanspot netwok link cpu host schematic memoy m $$ $ $ C ) link physical contolle physical tansmission host bus (e.g., PCI) )+ + + netwok adapte cad 5: DataLink Laye 5-8
9 datagam datagam contolle contolle sending host eceiving host datagam fame * m $ + m $+ +$ $ m ) +$ $ m 8 $* 5: DataLink Laye 5-9
10 -. * %/ 01 $$ $ "$ / 2"$ ' D $ : DataLink Laye 5-10
11 / ;) $+$ > /-&&E $)$, > $ )$ > $/+$$) othewise 5: DataLink Laye 5-11
12 3 6$F3 $F : DataLink Laye 5-12
13 :$ <=? +$)@?$ $@ 6 G+-2")?-C $@+ *$H 3 +$!* + * + G$+$*$ m ( " m I/6" F) $B 5: DataLink Laye 5-13
14 $! * ) )) J-)?@ : $!)! m K!L8$*)$):?$%@ m * : *K!L):.+"5, m $$)$J-) $?4&%--# 9 5: DataLink Laye 5-14
15 !/8$ # % M (!!;: G*$$ % ;:M (!! G*$$ + * % ) :!! ;NO % : 5: DataLink Laye 5-15
16 -. * %/ 01 $$ $ "$ / 2"$ ' D $ : DataLink Laye 5-16
17 1 $$3$ +<$= "" m 333+$" m ""$) / m $"+/ m P9 m 4&%-- $? )$/@!9? 4&%--# 9@!9?$$@ $? $@ 5: DataLink Laye 5-17
18 1 $$$ $)$ $) + m $$ +* $ $$$ )$ $ )$$ $+, m "+")$+ 5: DataLink Laye 5-18
19 .$1 $$3$ F$+!) -! % 1 *!Q1 0+$$$5 m $ m 5+$ $ $ 5: DataLink Laye 5-19
20 1 3$8 )$ $3 m *$$$<=?$ m $$+8$*! m $* $$ $$ m <*= +$$ <= m ) $ 5: DataLink Laye 5-20
21 $31 $1 1 *$$ $RR $$ 8$2" - 0 * $% 2 $ 2"$ + 5: DataLink Laye 5-21
22 $31 $ G*$$ $*+G) +8+G) +G)$ 8$2" - 0 * +G )% 2$ 91 )$ +G) 5: DataLink Laye 5-22
23 !3$ # m +$$$! m <$$= 1 $+ m $$ m *+$$? /8$+1 $ m $( P m ( P m Q 61 Q 5: DataLink Laye 5-23
24 6$( P $$+5 *G$ 5$? -+@ $$) 5 +% $ $$ $$ ( )+ + 8 $ m +$$ +8 $ m +$$ + )G$ )$ 5: DataLink Laye 5-24
25 6$( P 3 $* $ +$$+$ $$5 $$ ) $ $$ $ $$ ))$ $$$ $5 5: DataLink Laye 5-25
26 6$$++ $" +++$$? $$ + $ ))$ ) * $ ;?-"@ ) ;?-"@ 8+++ S85?-"@ + $+ S?-"S@ + * 1 8++;-Q;0' ) $ ++$ 0' E +,, 5: DataLink Laye 5-26
27 P $$$ 5 ++* m $ $$))$ m + & $$ +N & "- & J-O 5: DataLink Laye 5-27
28 3$++ 3?N & "- & O 3?N & "- & O ;?-"@?-"@?-"@ T $"L+ ;-Q?%@;-4 * $$, 5: DataLink Laye 5-28
29 61?61 # $)+.+$$+.+$) + $C, 5: DataLink Laye 5-29
30 61 $$ $$+ $$ $$ $ C $$ $+U $$$ ))$ 5: DataLink Laye 5-30
31 61 61 Q +$61 m $$ m $$) $ $$ m $ *$ m ++$ $ *$ * $)$$ $$*$ 5: DataLink Laye 5-31
32 61 Q$$ 5: DataLink Laye 5-32
33 <= 1 $ $1 $ m $++$ +$ $ m ++$ $$$ -Q ) $$*+$-*,!1 $ m ++$ $$+$$ $5$ m $$$* <= $ $+)+) $, 5: DataLink Laye 5-33
34 <= 1 $ 3$$ <*= $* $$ $$ <)= $** m $$* m $ $* m $+ +$?@ 5: DataLink Laye 5-34
35 <= 1 $ $ +8 G$$ m * m $ m 5: DataLink Laye 5-35
36 6+1 $ $ ) +G m * 9G*?@ m ( P 6"( P Q m $@ m 61 Q/ m 61 Q4&%-- m $$+$ m F$ 9..F1! 5: DataLink Laye 5-36
37 $ $$+ m * Q $$ 8 $ m m / m m 333 5: DataLink Laye 5-37
38 -. * %/ 01 $$ $ " / 2"$ ' D $ : DataLink Laye 5-38
39 1!3 0%").3 m "$ m.3) 1? $/@ m m 4 > ).!( 1 $+ )$ 5: DataLink Laye 5-39
40 !3 / G -"%9"FF"'2"&V" F; 99"99"99"99"99"99 '-"2 "9'"%F"&4" 0? $@ 4"%0"'"9"%&"F& ; &""--"29"/0"V4 5: DataLink Laye 5-40
41 1 $$)./// +)+1?G@ $?@1 $6$6 )?)@.3$$ 1 +$ )$ m * +.3$ ( )$ m.3) 5: DataLink Laye 5-41
42 !3!$3$ A 1 +F FC.3B -0'-V2'%0 '-"2 "9'"%F"&4" 0-0'-V2''4 -"%9"FF"'2"&V" -0'-V2'- 4"%0"'"9"%&"F& + K.3W1 WL m?*@ + $$)+?$$%&@ -0'-V2'44 &""--"29"/0"V4 5: DataLink Laye 5-42
43 F FC1 C!3)$ )!3G FX.3 m 1 ;99" 99"99"99"99"99?*@.3"" 1!3)$$+ )$?@ m m $$ *!3G F*!3 $?FX@ 1!3<$""$= m!3 )$ *+ m +C1?@ 5: DataLink Laye 5-43
44 P3P+3$ :$ $$ $$).3 + * 7 m +)$7 m $$ m $ P3** m -)<P3*= m %P3* <P3++= m 0G.3<P3G= m P3*<P3= 5: DataLink Laye 5-44
45 P3$"* DHCP seve F / *P3 $?%%0-%Q%@ 5: DataLink Laye 5-45
46 P3$"* P3*%%0-% DHCP discove sc : , 68 dest.: ,67 yiadd: tansaction ID: 654 * $ DHCP equest DHCP offe sc: , 68 dest:: , 67 yiadd: tansaction ID: 655 Lifetime: 3600 secs sc: , 67 dest: , 68 yiadd: tansaction ID: 654 Lifetime: 3600 secs DHCP ACK sc: , 67 dest: , 68 yiadd: tansaction ID: 655 Lifetime: 3600 secs 5: DataLink Laye 5-46
47 $+F*! FC C-E8-FF E6-E BB-4B 1A-23-F9-CD-06-9B 88-B2-2F-54-1A-0F CC-49-DE-D0-AB-7D ! F 49-BD-D2-C7-56-2A!3)$! 5: DataLink Laye 5-47
48 .3 F!3!C & $"$+!X1 +""F.3 C.+!C.*+!*.3+/+ F!!3FC1 $$ 8$Y,!+""F.3F C-E8-FF E6-E BB-4B 1A-23-F9-CD-06-9B 88-B2-2F-54-1A-0F CC-49-DE-D0-AB-7D ! F 49-BD-D2-C7-56-2A 5: DataLink Laye 5-48
49 -. * %/ 01 $$ $ " / 2"$ ' D $ : DataLink Laye 5-49
50 / <= $ Z %&+. + $ $ $ 1 -&1 )Y -&:) 1 $+C/ 5: DataLink Laye 5-50
51 6$ )$$V& m $*$ m * m <=?@/$? )8$)$ 5: DataLink Laye 5-51
52 /96 6$.3? 3)$ ' ) -&-&-&-&+$$ ) ) -&-&-&-- 5* $ 5: DataLink Laye 5-52
53 2) m +*+ )?!3@ + $$ m + $$?$.3 ))$ *$$.3M $$@! * + + 5: DataLink Laye 5-53
54 /H $)$ $ $ ) *. $)$ *.C. m + $*?@ m $$)+$$+3 m $$ /C1 $$ 61 Q 5: DataLink Laye 5-54
55 /61 Q$ -.* + $ + %.+.$$ +.+.$ ) $$ $ ,.+. $ ) 7$ +). $% + $$. + [& - % T % "-\. ] -%) 6% 5: DataLink Laye 5-55
56 /C61 6$ $$ +$$W4 ) F - +-& 1 )/W +;-&%0 ) & 6Q * $# # ) $, /8$F++ :$ $ m *$ $$)$ +$$+ [& -\W$] -%) +$$ +[& - % 0\T +$$ +[& - % 0 T -&%0\ 5: DataLink Laye 5-56
57 61 Q++ ;8$) % ;8"5+ efficiency = 1+ 5t 1 pop /t tans ++- m & m + )+( P$ $5, 5: DataLink Laye 5-57
58 4&%0/6U 3$ ++/ m 1 $++ m ++%1 ) -&1 ) -&&1 ) -:) -&:) m ++$$+) )$ application tanspot netwok link physical 100BASE-TX 100BASE-T4 MAC potocol and fame fomat 100BASE-T2 100BASE-SX 100BASE-FX +)$$ 5: DataLink Laye 5-58
59 1 -&F ) $$ $* 5 m +$5 $)$$, P $"$++, 5: DataLink Laye 5-59
60 -. * %/ 01 $$ $ "$ / 2"$ ' D $ : DataLink Laye 5-60
61 P) T $"$?<)=@ m )$$$$ m $$)$$ m +)++ m 61 Q). $$ ) 5: DataLink Laye 5-61
62 6 $"$*) * $ m + /+ m 8+C1 $*$ + +"" $ +)+ 61 Q m ++ $""$ $+"$ m )+ 5: DataLink Laye 5-62
63 6 $$ $$ $ * )++ /$ $ ) $$W+$$$8 m $ $$ ""C F" "FC $$ $$ m )$ )) C FC 2 - % 0 C F 8+?- % 0 2@ 5: DataLink Laye 5-63
64 6 )$ A C )$*+ FC )$*+ B C F )$ 2 - % 0 m?1 + $$)$, A )$B m $ $B FC C 8+?- % 0 2@ 5: DataLink Laye 5-64
65 6 $+"$ 6 C C $ ) + C F m +* <$= $+ m Q$ )$ FC 2 - % 0 C & 6 )$?$$@ 5: DataLink Laye 5-65
66 6 ++$Q+ # +* -$ %8 )$1 & ++ '( + +* ' + ) $ + $$)+ +* 5: DataLink Laye 5-66
67 6$+"$ + 8$ C C 6 C F + +$ $ $* FC - % C 2 0 C C & C 2& 6 )$?$$@ 5: DataLink Laye 5-67
68 . ) 6 F 6-6 % / 9 : 6 0 P. A +9" *6 6 0 B $+$,? 8$ $",@ 5: DataLink Laye 5-68
69 6$+"$$" 8$ F 6-6 % % / 9 : 6 0 P. A )$+ 6-6 % : DataLink Laye 5-69
70 .$ 8$ $* )*.3) 5: DataLink Laye 5-70
71 6 *! )""+ * m $*?8 m $$* )$ $ $ )$ $ +$ $$ 5: DataLink Laye 5-71
72 6 ++ $ ) $U $ $ 5: DataLink Laye 5-72
73 -. * %/ 01 $$ $ " / 2P) ' D $5 1 5: DataLink Laye 5-73
74 33$ * $ )$ m 1 $ m +8$1 m $$.6 $ $""$ m 333?""$@ m PP$*$$$?$ )<$= $, 5: DataLink Laye 5-74
75 333!GN!9- ' O + $+ "$ $+ m $+ $ $?7.3@ m )$$$8 ) ) +$?@ $* $$+$ $ $ $Q+C 5: DataLink Laye 5-75
76 333"G Q* +$ $ +$*( $$? $$@ /* +$ $ " $$$$, 5: DataLink Laye 5-76
77 3339 9$ $ W+)$ $$$+$ 3$ $$ + $*? 5: DataLink Laye 5-77
78 $) $+ 5: DataLink Laye 5-78
79 F6++ <= G+$ )$$ $+$K&------&L m A *K&------&L+$B 6?<++=@8K&------&L) +K&------&L)!* m &------&) +) m $&------&+$) 5: DataLink Laye 5-79
80 F6++ +$) +$)$ ++) 5: DataLink Laye 5-80
81 333$3$ F+8 " $ $ +333$?8 $Q+ $+ m +.3.3$ 3$?.33@?$+$4&%-@ +Q$.3 5: DataLink Laye 5-81
82 -. * %/ 01 $$ $ " / 2P) ' D $ : DataLink Laye 5-82
83 D $5+ D $5+ +$) 8$*$ *$ * m D $ 7* m.f1 D 1 +-V2&CQ'&C $+)C $+ $ $ $$ $ $ )$ 5: DataLink Laye 5-83
84 .*$5 -V' $$ m!3 m "*")$ m $$?$@ m T ++ m * m + m * m!3 "A Potocol fo Packet Netwok Intecommunication", V. Cef, R. Kahn, IEEE Tansactions on Communications, May, 1974, pp $$ 5: DataLink Laye 5-84
85 .*$5. $ + $$$ + : <) $$+8 =? $*$@ 8!3 $$ 5: DataLink Laye 5-85
86 +U C. # *$5B $+ $$ $?.3@* $ $$$ $ m )$ m $$ m 2$ m T <*)$= $$$ $$.3, 5: DataLink Laye 5-86
87 m ++*$ +. * ).$$$.3 m $ 5: DataLink Laye 5-87
88 +1 1 ** +,-+ + ''%?- 1 ) 2%%1 )@F). 6*$ :$ "+* * m QA 6G+* *?*.)"++$@ m <8= $$ $ $ m "?+8$ $$ <$$=@*$ 5: DataLink Laye 5-88
89 $ $ $ $ $ $+1 m Q)$ m $$.$ 1 $ < = $ m $$ $$ 5: DataLink Laye 5-89
90 1 $$B D "" <1 + = m 1 $!$.3)) m <.3*1 = m 1 $$ : DataLink Laye 5-90
91 1 # %.?@<= $?.3*1 $@1 $)$ +$$1 $$ m $ $ $ $ $ 5: DataLink Laye 5-91
92 ++*+$ 1 *$ - +F!?F!@* $ % +D F!?D )$F!@* 1 3/:* +?.3@ H 3H 1 $$ 5: DataLink Laye 5-92
93 1 6* $$1 $.3 $ *++*.3 $ 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 5: DataLink Laye 5-93
94 1 D $ D $$D + m $$ +$$)+ +$ m D +?.@ m * "<= + m $?) )++@)$$ D "$+ m $$ m $$<= ).3 6 m $$"$$) 5: DataLink Laye 5-94
95 1 D *+1 D m A 6++ D?) $ $7@ )+1 D m m 3D ) Q@ $? S%@ m 6D $$$ *+$* 5: DataLink Laye 5-95
96 1 1 $$ ")1 $$ 4")$ m # B$$$"L$$"$ +5* m $+ ) 0%2?,@ $$ $$+ 5: DataLink Laye 5-96
97 1 $$ / 0 *$$. m $$ +$$ 12 3$?!1 $$*$$@.1$$3) m 3;-$$ $$ ) + 3 P/ m $ 5: DataLink Laye 5-97
98 1 1 $)*31 )$ )$ 3$1 $ ) 69 m P'4 4 )! m $$ m # <= 31 )$ + $$ 5: DataLink Laye 5-98
99 1 3$ 5 2-! 3 +?$ )@W m )5W m m *$( 0;- %1 )W( -%;2%%&4 1 )W( 4 ;% :) ( -V%;V 2:) ?$ $@- 1 )Q 1 ) 4447$$?)Q$@ 5: DataLink Laye 5-99
100 .3"( *"1 $.3$ 0< 1?4&%0@.3.3*1 $< / / 5: DataLink Laye 5-100
101 .3"( *"1.3 /.3 / : DataLink Laye 5-101
102 .3"*"1 6P m.3$).3 m m $ $$ 1 $ 1 *$$$D P m )$$$$ m +!(.3 5: DataLink Laye 5-102
103 .3"( *" H m 7$.3 4&%01, / 1 5: DataLink Laye 5-103
104 1 $$$)$?1 $$.3+ )+8 + m ) +D m ).3$$.3, PPP o Ethenet heade MPLS heade IP heade emainde of link-laye fame label Exp S TTL : DataLink Laye 5-104
105 1 36)$ $)$" + +) $$)$*$?C.3@ m )$+.3+ )$ $$+ m!6d 3"/ m + )$$.3$ $ $$? "+@,, m "8.3"$ 5: DataLink Laye 5-105
106 1 36+ )$ in out out label label dest inteface 10 A 0 12 D 0 8 A 1 in out out label label dest inteface 10 6 A D 0 R6 R5 R4 0 R2 in out out label label dest inteface A 0 R D 0 A in out R1 out label label dest inteface 6 - A 0 5: DataLink Laye 5-106
107 6 $)$$* m m )$$$ m $$ $+*$ $$ m / m 6 m 333 m *$5 $$ : DataLink Laye 5-107
108 $C) 7 $$?83PI@ $+ $ T$T)$+, m $ m $ m m 5: DataLink Laye 5-108
# $!$ %&&' Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved
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)
! "# $ $ %&&' 3-1. Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved
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)
Chapter 4. Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, sl April 2009.
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
Accelerating Storage with RDMA Max Gurtovoy Mellanox Technologies
Acceleating Stoage with RDMA Max Gutovoy Mellanox Technologies 2018 Stoage Develope Confeence EMEA. Mellanox Technologies. All Rights Reseved. 1 What is RDMA? Remote Diect Memoy Access - povides the ability
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
CC451 Computer Networks
CC451 Computer Networks Lecture 9 Link Layer 5: DataLink Layer 5-1 Chapter 5 Link Layer and LANs A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students,
Chapter 6 The Link Layer and LANs
Chapter 6 The Link Layer and LANs A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the
Module 10 Data Link Layer CS655! 10-1!
Module 10 Data Link Layer CS655! 10-1! Please note: Most of these slides come from this book. Note their copyright notice below! A note on the use of these ppt slides: We re making these slides freely
Chapter 6 The Link Layer and LANs
Chapter 6 The Link Layer and LANs A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the
Chapter 3 Transport Layer
Chapte 3 Tanspot Laye 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
1.3 Multiplexing, Time-Switching, Point-to-Point versus Buses
http://achvlsi.ics.foth.g/~kateveni/534 1.3 Multiplexing, Time-Switching, Point-to-Point vesus Buses n R m Aggegation (multiplexing) Distibution (demultiplexing) Simplest Netwoking, like simplest pogamming:
Prioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
Configuring RSVP-ATM QoS Interworking
Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
CS 3516: Computer Networks
Welcome to CS 3516: Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: AK219 Fall 2018 A-term 1 Some slides are originally from the course materials of the textbook Computer
Chapter 3 Transport Layer
Chapter 3 Transport Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
IP Multicast Simulation in OPNET
IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok
Persistent Memory what developers need to know Mark Carlson Co-chair SNIA Technical Council Toshiba
Pesistent Memoy what developes need to know Mak Calson Co-chai SNIA Technical Council Toshiba 2018 Stoage Develope Confeence EMEA. All Rights Reseved. 1 Contents Welcome Pesistent Memoy Oveview Non-Volatile
Lecture 9 Ethernet and other Link Layer protocols
Lecture 9 Ethernet and other Link Layer protocols From Kurose & Ross Book slightly modified by Romaric Duvignau duvignau@chalmers.se Thanks and enjoy! JFK/KWR All material copyright 1996-2016 J.F Kurose
Chapter 4: Network Layer
Mecanismes d Echange d Informations Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint
Chapter 4 Network Layer
Chapte 4 Netwok Laye Reti di Elaboatoi Coso di Lauea in Infomatica Univesità degli Studi di Roma La Sapienza Canale A-L Pof.ssa Chiaa Petioli Pate di queste slide sono state pese dal mateiale associato
Chapter 5 Link Layer. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 All material copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved
Chapter 4. DataLink Layer. Reference: Computer Networking: A Top Down Approach 4 th edition. Jim Kurose, Keith Ross Addison-Wesley, July 2007.
Chapter 4 DataLink Layer Reference: Computer Networking: A Top Down Approach 4 th edition. Jim Kurose, Keith Ross Addison-Wesley, July 2007. DataLink Layer Link Layer 4.1 Link-Layer Addressing 4.2 Ethernet
Chapter 4 Network Layer: The Data Plane. Part A. Computer Networking: A Top Down Approach
Chapter 4 Network Layer: The Data Plane Part A All material copyright 996-06 J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down Approach 7 th Edition, Global Edition Jim Kurose,
Chapter 2 Application Layer
Chapter 2 Application Layer A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations;
THE THETA BLOCKCHAIN
THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent
An Improved Resource Reservation Protocol
Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing
Chapter 3 Transport Layer
Chapter 3 Transport Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
CIS-331 Exam 2 Fall 2014 Total of 105 Points. Version 1
Version 1 1. (20 Points) Given the class A network address 119.0.0.0 will be divided into a maximum of 15,900 subnets. a. (5 Points) How many bits will be necessary to address the 15,900 subnets? b. (5
Computer Networks. Instructor: Niklas Carlsson
Computer Networks Instructor: Niklas Carlsson Email: niklas.carlsson@liu.se Notes derived from Computer Networking: A Top Down Approach, by Jim Kurose and Keith Ross, Addison-Wesley. The slides are adapted
Communication Networks ( ) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University. Allon Wagner
Communication Networks (0368-3030) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University Allon Wagner Kurose & Ross, Chapter 4 (5 th ed.) Many slides adapted from: J. Kurose & K. Ross
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
EE 6900: Interconnection Networks for HPC Systems Fall 2016
EE 6900: Inteconnection Netwoks fo HPC Systems Fall 2016 Avinash Kaanth Kodi School of Electical Engineeing and Compute Science Ohio Univesity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement: Inteconnection
Chapter 3 Transport Layer
Chapter 3 Transport Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
Module 4 Data Link Layer CS655! 4-1!
Module 4 Data Link Layer CS655! 4-1! Please note: Most of these slides come from this book. Note their copyright notice below! A note on the use of these ppt slides: We re making these slides freely available
Lecture 7. Network Layer. Network Layer 1-1
Lecture 7 Network Layer Network Layer 1-1 Agenda Introduction to the Network Layer Network layer functions Service models Network layer connection and connectionless services Introduction to data routing
Chapter 3 Transport Layer
Chapter 3 Transport Layer A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations;
Chapter 5 Link Layer. Down Approach. Computer Networking: A Top. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Slides adopted from original ones provided by the textbook authors. Link layer,
RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver
1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent
Pipes, connections, channels and multiplexors
Pipes, connections, channels and multiplexos Fancisco J. Ballesteos ABSTRACT Channels in the style of CSP ae a poeful abstaction. The ae close to pipes and connections used to inteconnect system and netok
Chapter 5 Link Layer and LANs
Chapter 5 Link Layer and LANs A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and
SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS
SCALABL NRGY FFICINT AD-HOC ON DMAND DISTANC VCTOR (S-AODV) ROUTING PROTOCOL IN WIRLSS MSH NTWORKS Sikande Singh Reseach Schola, Depatment of Compute Science & ngineeing, Punjab ngineeing College (PC),
dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc
- CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish
"$% "& & Thanks and enjoy! JFK/KWR. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved. 8: Network Security 8-1
A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete slides (including this
Chapter 3 Transport Layer
Chapte 3 Tanspot Laye Reti di Elaboatoi Coso di Lauea in Infomatica Univesità degli Studi di Roma La Sapienza Canale A-L Pof.ssa Chiaa Petioli Pate di queste slide sono state pese dal mateiale associato
MAC Protocol for Supporting QoS in All-IP HiperLAN2
MAC Potocol fo Suppoting QoS in All-IP HipeLAN Chistos E. Politis, Rahim Tafazolli Univesity of Suey Cente fo Communication Systems Reseach Guildfod, GU 7XH, Suey, UK Tel.: +44 483 683463, FAX: +44 483
CS 43: Computer Networks Switches and LANs. Kevin Webb Swarthmore College December 5, 2017
CS 43: Computer Networks Switches and LANs Kevin Webb Swarthmore College December 5, 2017 Ethernet Metcalfe s Ethernet sketch Dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology
Lecture 16: Router Design
Lecture 16: Router Design CSE 123: Computer Networks Alex C. Snoeren Eample courtesy Mike Freedman Lecture 16 Overview End-to-end lookup and forwarding example Router internals Buffering Scheduling 2 Example:
CIS-331 Fall 2013 Exam 1 Name: Total of 120 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. NOTE: Router E should only be used for Internet traffic. Router A Router
Chapter 7: Multimedia Networking
Chapter 7: Multimedia Networking Multimedia and Quality of Service: What is it multimedia : network audio and video ( continuous media ) A note on the use of these ppt slides: We re making these slides
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
CIS-331 Spring 2016 Exam 1 Name: Total of 109 Points Version 1
Version 1 Instructions Write your name on the exam paper. Write your name and version number on the top of the yellow paper. Answer Question 1 on the exam paper. Answer Questions 2-4 on the yellow paper.
Lecture 16: Network Layer Overview, Internet Protocol
Lecture 16: Network Layer Overview, Internet Protocol COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
CS 471G Friday, 11 January Introduction 2-1
CS 471G Friday, 11 January 2013 Introduction 2-1 Chapter 1 Introduction A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in
Topic 4a Router Operation and Scheduling. Ch4: Network Layer: The Data Plane. Computer Networking: A Top Down Approach
Topic 4a Router Operation and Scheduling Ch4: Network Layer: The Data Plane Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross Pearson/Addison Wesley April 2016 4-1 Chapter 4:
Chapter 5 Link Layer and LANs
Chapter 5 Link Layer and LANs A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and
CSCD 330 Network Programming Spring 2017
CSCD 330 Network Programming Spring 2017 Lecture 18 Link Layer Protocols Continued Who is this? Reading: Chapter 5 Some slides provided courtesy of J.F Kurose and K.W. Ross, All Rights Reserved, copyright
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth
IP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
Key Network-Layer Functions
Network Layer: Routing & Forwarding Instructor: Anirban Mahanti Office: ICT 745 Email: mahanti@cpsc.ucalgary.ca Class Location: ICT 121 Lectures: MWF 12:00 12:50 hours Notes derived from Computer Networking:
UCB CS61C : Machine Structures
inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called
Chapter 4 Network Layer
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and
Traffic Management and. QoS Issues for Large High-Speed Networks
Traffic Management and QoS Issues for Large High-Speed Networks Columbus, OH 43210 Jain@CIS.Ohio-State.Edu This presentation is available on-line: http://www.cis.ohio-state.edu/~jain/talks/nas_ipg.htm
Chapter 1 Introduction
Chapter 1 Introduction A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations;
SIMOCODE pro. Motor Management and Control Devices. SIMOCODE pro for Modbus RTU. Answers for industry. Edition 04/2015
SIMOCODE po Moto Management and Contol Devices SIMOCODE po fo Modbus RTU Geätehandbuch Configuation Manual Edition 04/2015 Answes fo industy. Intoduction 1 System configuation and commissioning with RTU
Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System
Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet
Network Layer: Chapter 4. The Data Plane. Computer Networking: A Top Down Approach
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set
Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
Chapter 5 Data Link Layer
Chapter 5 Data Link Layer Reti degli Elaboratori Canale AL Prof.ssa Chiara Petrioli a.a. 2013/2014 We thank for the support material Prof. Kurose-Ross All material copyright 1996-2012 J.F Kurose and K.W.
CIS-331 Exam 2 Fall 2015 Total of 105 Points Version 1
Version 1 1. (20 Points) Given the class A network address 117.0.0.0 will be divided into multiple subnets. a. (5 Points) How many bits will be necessary to address 4,000 subnets? b. (5 Points) What is
Lecture 20: Link Layer
Lecture 20: Link Layer COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose and K.W. Ross, All Rights
Chapter 5 Link Layer and LANs
Chapter 5 Link Layer and LANs A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and
Chapter 8 Network Security
Chapter 8 Network Security A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and
Chapter 5 Link Layer. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 5 Link Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and can
CSEN 503 Introduction to Communication Networks. Mervat AbuElkheir Hana Medhat Ayman Dayf. **Slides are attributed to J. F. Kurose
CSEN 503 Introduction to Communication Networks Mervat AbuElkheir Hana Medhat Ayman Dayf **Slides are attributed to J. F. Kurose 1-2 Link Layer Link Layer: Introduction Some terminology: hosts and routers
Web Protocols and Practice
Web Protocols and Practice Dogan Kesdogan Aachen University of Technology Department of Computer Science IV Communication and Distributed Systems Introduction 1-1 Staff Instructor: Dogan Kesdogan, kesdogan@informatik.rwth-aachen.de
Gateway Ascii Command Protocol
Gateway Ascii Command Protocol Table Of Contents Introduction....2 Ascii Commands.....3 Messages Received From The Gateway....3 Button Down Message.....3 Button Up Message....3 Button Maintain Message....4
CIS-331 Final Exam Spring 2015 Total of 115 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
Multidimensional Testing
Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of
IP MULTICAST. Adiseshu Hari, T. V. Lakshman and Gordon Wilfong Nokia Bell Labs
IP MULTICAST Adiseshu Hai, T. V. Lakshman and Godon Wilfong Nokia DIMACS Wokshop on Algoithms fo Data Cente Netwoks Rutges Univesity, NJ 1 Why is IP Multicast not deployed in public netwoks? Denial-of-Sevice
Chapter 4 Network Layer: The Data Plane
Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see
Chapter 9. Multimedia Networking. Computer Networking: A Top Down Approach
Chapter 9 Multimedia Networking A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations;
Introduction To Pipelining. Chapter Pipelining1 1
Intoduction To Pipelining Chapte 6.1 - Pipelining1 1 Mooe s Law Mooe s Law says that the numbe of pocessos on a chip doubles about evey 18 months. Given the data on the following two slides, is this tue?
Exploring non-typical memcache architectures for decreased latency and distributed network usage.
Syacuse Univesity SURFACE Electical Engineeing and Compute Science Technical Repots College of Engineeing and Compute Science 9-5-20 Exploing non-typical memcache achitectues fo deceased latency and distibuted
Chapter 8 Security. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 8 Security A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and can add,
The Internet Ecosystem and Evolution
The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee
An Identification Protocol based the secure USB
An Identification otocol based the secue UB Chol-Un KIM ok-jun AN and u-nam HAN Faculty of Mathematics Kim Il ung Univesity yongyang..r.k. Abstact In this pape we poposed an identification potocol which
Chapter 3: Transport Layer. Chapter 3 Transport Layer. Chapter 3 outline. Transport services and protocols
Chapter 3 Transport Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
IS-IS Protocol Hardware Implementation for VPN Solutions
IS-IS Potocol Hadwae Implementation fo VPN Solutions MOHAMED ABOU-GABAL, RAYMOND PETERKIN, DAN IONESCU School of Infomation Technology and Engineeing (SITE) Univesity of Ottawa 161 Louis Pasteu, P.O. Box
i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA
i-pcgrid Wokshop 2016 Apil 1 st 2016 San Fancisco, CA Liang Min* Eddy Banks, Bian Kelley, Met Kokali, Yining Qin, Steve Smith, Philip Top, and Caol Woodwad *min2@llnl.gov, 925-422-1187 LDRD 13-ERD-043
Advances in Automobile Engineering
nadvances in Automobile E gineeing ISSN: 2167-7670 Advances in Automobile Engineeing Kabi, 2012, 1:3 DOI: 10.4172/2167-7670.1000101 Reseach Aticle Open Access Netwok Achitectue of a Moden Automotive Infotainment
Chapter 4 Network Layer
Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and
CSC358 Week 6. Adapted from slides by J.F. Kurose and K. W. Ross. All material copyright J.F Kurose and K.W. Ross, All Rights Reserved
CSC358 Week 6 Adapted from slides by J.F. Kurose and K. W. Ross. All material copyright 1996-2016 J.F Kurose and K.W. Ross, All Rights Reserved Logistics Assignment 2 posted, due Feb 24, 10pm Next week
Chapter 5 Link Layer. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 All material copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved
Chapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. Network Layer 4-1 Chapter 4: Network Layer Chapter
An effective hop-by-hop Interest shaping mechanism for CCN communications
An effective hop-by-hop Inteest shaping mechanism fo CCN communications Natalya Rozhnova, Sege Fdida To cite this vesion: Natalya Rozhnova, Sege Fdida. An effective hop-by-hop Inteest shaping mechanism
COSC 6385 Computer Architecture. - Pipelining
COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped
CIS-331 Fall 2014 Exam 1 Name: Total of 109 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. Router A Router B Router C Router D Network Next Hop Next Hop Next Hop Next