cs244a: an introduction to computer networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 an...
TRANSCRIPT
![Page 1: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/1.jpg)
1
An Int roduct ion to Com puter Networks
Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden
Prof. Dina Kat abi
Chap ter 7
![Page 2: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/2.jpg)
2
Chapter Out line
Int roduct ion (slides and 7.A)
Layered Architecture (slides and 7.B & 7.D)
Rout ing (slides and 7.D)
Reliable Transm ission & Flow Cont rol (slides and read 7.E)
Congest ion Cont rol (slides and read 7.F)
![Page 3: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/3.jpg)
3
This Lecture
What is a network?
Sharing the infrast ructureCircuit switching
Packet switching
Best Effort ServiceAnalogy: the m ail system
Internet ’s Best Effort Service
![Page 4: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/4.jpg)
4
NetworksWhy they are interest ing?
Overcom e geographic lim its
Access rem ote data
Separate clients and server
Goal: Universal Comm unicat ion (any to any)
Design the cloud
Network
![Page 5: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/5.jpg)
5
Connect ivity
Link DSL, T1, T3, ... Characterized by
Capacity or bit -rate (1.5 Mb/s, 100Mb/s, …)Propagat ion delay (10us, 10m s, 100m s, ..)Transfer t im e on a link = # bit /bit -rate + propagat ion delay
![Page 6: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/6.jpg)
6
Connect ivity
A mesh requires N2 links too cost ly
![Page 7: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/7.jpg)
7
We Have to Share the Infrast ructure
Intermediate nodes called switches or routers allow the hosts to share the infrast ructure
![Page 8: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/8.jpg)
8
This Lecture
What is a network?
Sharing the infrast ructureCircuit switching
Packet switching
Best Effort ServiceAnalogy: the m ail system
Internet ’s Best Effort Service
![Page 9: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/9.jpg)
9
Two ways to share
Circuit switching (isochronous)
Packet switching (asynchronous)
![Page 10: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/10.jpg)
10
Circuit Switching
DATA
Caller Callee
Boston Switch
LA Switch
propagation delay between caller and and Boston switch
processing delay at switch
It ’s the m ethod used by the telephone networkA call has three phases:
1. Establish circuit from end-to-end (“ dialing” ),
2. Com m unicate,3. Close circuit (“ tear
down” ).
If circuit not available: “ busy signal”
(1)
(2)
(3)
![Page 11: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/11.jpg)
11
Switch
Circuit Switching: Mult iplexing/Dem ult iplexing
Time divided into frames and frames divided into slotsRelat ive slot posit ion inside a frame determines which conversat ion the data belongs to
E.g., slot 0 belongs to the red conversat ionNeed synchronizat ion between sender and receiver
Frames
0 1 2 3 4 5 0 1 2 3 4 5Slots =
One way for sharing a circuit is TDM:
Lecture notes use the word “fram e” for s lot
![Page 12: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/12.jpg)
12
Circuit SwitchingAssume link capacity is C bits/sec
Each communicat ion requires R bits/sec
# slots = C/R
Maximum number of concurrent communicat ions is C/R
What happens if we have more than C/R communicat ions?
What happens if the a communicat ion sends less/more than R bits/sec?
Design is unsuitable for computer networks where t ransfers have variable rate (bursty)
![Page 13: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/13.jpg)
13
Internet Traffic Is Bursty
Daily t raffic at an MIT-CSAIL router
Max In :12.2Mb/ s Avg. In : 2 .5Mb/ s
Max Out : 12.8Mb/ s Avg. Out : 3.4 Mb/ s
![Page 14: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/14.jpg)
14
Packet SwitchingUsed in the InternetData is sent in Packets (header contains control info, e.g., source and dest inat ion addresses)
Per-packet rout ingAt each node the ent ire packet is received, stored, and then forwarded (store-and-forward networks)No capacity is allocated
Header Data
Packet 1
Packet 2
Packet 3
Packet 1
Packet 2
Packet 3
Packet 1
Packet 2
Packet 3
processing delay of Packet 1 at Node 2
propagationdelay betweenHost 1 & Node 2
t ransmission t ime of Packet 1at Host 1
Host 1 Host 2
Node 1 Node 2
![Page 15: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/15.jpg)
15
Router
Packet Switching: Mult iplexing/Demult iplexing
Mult iplex using a queueRouters need m em ory/buffer
Demult iplex using inform at ion in packet header
Header has dest inat ion Router has a rout ing table that contains inform at ion about which link to use to reach a dest inat ion
Queue
![Page 16: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/16.jpg)
16
Queues int roduce
Variable DelayDelay = Queuing delay + propagat ion delay + t ransm ission delay + processing delay
LossesWhen packets arrive to a full queue/buffer they are dropped
![Page 17: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/17.jpg)
17
Packet switching also show reordering
Host A
Host BHost E
Host D
Host C
Node 1 Node 2
Node 3
Node 4
Node 5
Node 6 Node 7
Packets in a flow may not follow the same path (depends on rout ing as we will see later) packets may be reordered
![Page 18: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/18.jpg)
18
This Lecture
What is a network?
Sharing the Infrast ructureCircuit switching
Packet switching
Best Effort ServiceAnalogy: the m ail system
Internet ’s Best Effort Service
![Page 19: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/19.jpg)
19
The m ail system
Dina Nick
MIT Stan ford
Admin Admin
![Page 20: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/20.jpg)
20
Characterist ics of the m ail system
Each envelope is individually routed
No t ime guarantee for delivery
No guarantee of delivery in sequence
No guarantee of delivery at all!Things get lost
How can we acknowledge delivery?
Ret ransm issionHow to determine when to ret ransmit? Timeout?
If m essage is re-sent too soon duplicates
![Page 21: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/21.jpg)
21
The m ail system
Dina Nick
MIT Stan ford
Admin Admin
![Page 22: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/22.jpg)
22
The Internet
Dina Nick
Nm s.csail.m it .ed u Leland .Stan ford .ed u
O.S. O.S.HeaderData Heade rData
Packet
![Page 23: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/23.jpg)
23
Characterist ics of the InternetEach packet is individually routedNo t im e guarantee for deliveryNo guarantee of delivery in sequenceNo guarantee of delivery at all!
Things get lostAcknowledgem entsRet ransm ission
How to determine when to retransmit? Timeout?
If packet is re-t ransm it ted too soon duplicate
![Page 24: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/24.jpg)
24
Best Effort
No Guarantees:
Variable Delay (jit ter)
Variable rate
Packet loss
Duplicates
Reordering
(notes also state maxim um packet length)
![Page 25: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/25.jpg)
25
Differences Between Circuit & Packet Switching
Send data immediatelyBefore sending data establishes a path
More efficientCapacity is wasted if data is bursty
Packets may be reordered, delayed, or dropped
No reordering; constant delay; no pkt drops
Different packets might follow different paths
All data in a single flow follow one path
No guarantees (best effort )
Guaranteed capacity
Packet -SwitchingCircuit -switching
![Page 26: CS244a: An Introduction to Computer Networksweb.mit.edu/6.033/2006/ · 2006-04-13 · 1 An Introduction to Computer Networks Some slides are from lectures by Nick Mckeown, Ion Stoica,](https://reader031.vdocuments.us/reader031/viewer/2022021823/5b353b087f8b9a8b4b8cd7cf/html5/thumbnails/26.jpg)
26
This Lecture
We learned how to share the network infrast ructure between many connect ions/flows
We also learned about the implicat ions of the sharing scheme (circuit or packet switching) on the service that the t raffic receives