Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.
-
date post
21-Dec-2015 -
Category
Documents
-
view
216 -
download
1
Transcript of Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.
![Page 1: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/1.jpg)
Announcement
• Project 2 out– Much harder than project 1, start early!
• Homework 2 due next Tu.
![Page 2: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/2.jpg)
Some slides are in courtesy of J. Kurose and K. Ross
Review of Previous Lecture
• Reliable transfer protocols– rdt2.1: sender, handles garbled ACK/NAKs– rdt2.2: a NAK-free protocol– rdt3.0: channels with errors and loss– Pipelined protocols
• Go-back-N
![Page 3: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/3.jpg)
Outline
• Reliable transfer protocols– Pipelined protocols
• Selective repeat
• Connection-oriented transport: TCP– Overview and segment structure– Reliable data transfer– Flow control– Connection management
• TCP congestion control (if time allowed)
![Page 4: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/4.jpg)
Selective Repeat
• receiver individually acknowledges all correctly received pkts– buffers pkts, as needed, for eventual in-order
delivery to upper layer
• sender only resends pkts for which ACK not received– sender timer for each unACKed pkt
• sender window– N consecutive seq #’s– again limits seq #s of sent, unACKed pkts
![Page 5: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/5.jpg)
Selective repeat: sender, receiver windows
![Page 6: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/6.jpg)
Selective repeat
data from above :
• if next available seq # in window, send pkt
timeout(n):
• resend pkt n, restart timer
ACK(n) in [sendbase,sendbase+N]:
• mark pkt n as received
• if n smallest unACKed pkt, advance window base to next unACKed seq #
senderpkt n in [rcvbase, rcvbase+N-1]
• send ACK(n)
• out-of-order: buffer
• in-order: deliver (also deliver buffered, in-order pkts), advance window to next not-yet-received pkt
pkt n in [rcvbase-N,rcvbase-1]
• ACK(n)
otherwise:
• ignore
receiver
![Page 7: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/7.jpg)
Selective repeat in action
![Page 8: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/8.jpg)
Selective repeat: dilemma
Example: • seq #’s: 0, 1, 2, 3
• window size=3
• receiver sees no difference in two scenarios!
• incorrectly passes duplicate data as new in (a)
Q: what relationship between seq # size and window size? How small need the window size be?
![Page 9: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/9.jpg)
Outline
• Reliable transfer protocols– Pipelined protocols
• Selective repeat
• Connection-oriented transport: TCP– Overview and segment structure– Reliable data transfer– Flow control– Connection management
![Page 10: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/10.jpg)
TCP: Overview RFCs: 793, 1122, 1323, 2018, 2581
• full duplex data:– bi-directional data flow
in same connection– MSS: maximum
segment size
• connection-oriented: – handshaking
(exchange of control msgs) init’s sender, receiver state before data exchange
• flow controlled:– sender will not
overwhelm receiver
• point-to-point:– one sender, one
receiver
• reliable, in-order byte steam:– no “message
boundaries”
• pipelined:– TCP congestion and flow
control set window size
• send & receive bufferssocketdoor
T C Psend buffer
T C Preceive buffer
socketdoor
segm ent
applicationwrites data
applicationreads data
![Page 11: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/11.jpg)
TCP segment structure
source port # dest port #
32 bits
applicationdata
(variable length)
sequence number
acknowledgement numberReceive window
Urg data pnterchecksum
FSRPAUheadlen
notused
Options (variable length)
URG: urgent data (generally not used)
ACK: ACK #valid
PSH: push data now(generally not used)
RST, SYN, FIN:connection estab(setup, teardown
commands)
# bytes rcvr willingto accept
countingby bytes of data(not segments!)
Internetchecksum
(as in UDP)
![Page 12: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/12.jpg)
TCP seq. #’s and ACKsSeq. #’s:
– byte stream “number” of first byte in segment’s data
ACKs:– seq # of next byte
expected from other side
– cumulative ACK
Q: how receiver handles out-of-order segments– A: TCP spec
doesn’t say, - up to implementor
Host A Host B
Seq=42, ACK=79, data = ‘C’
Seq=79, ACK=43, data = ‘C’
Seq=43, ACK=80
Usertypes
‘C’
host ACKsreceipt
of echoed‘C’
host ACKsreceipt of
‘C’, echoesback ‘C’
timesimple telnet scenario
![Page 13: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/13.jpg)
TCP Round Trip Time and Timeout
Q: how to set TCP timeout value?
• longer than RTT– but RTT varies
• too short: premature timeout– unnecessary
retransmissions
• too long: slow reaction to segment loss
Q: how to estimate RTT?
• SampleRTT: measured time from segment transmission until ACK receipt– ignore retransmissions
• SampleRTT will vary, want estimated RTT “smoother”– average several recent
measurements, not just current SampleRTT
![Page 14: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/14.jpg)
TCP Round Trip Time and Timeout
EstimatedRTT = (1- )*EstimatedRTT + *SampleRTT
• Exponential weighted moving average
• influence of past sample decreases exponentially fast
• typical value: = 0.125
![Page 15: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/15.jpg)
Example RTT estimation:RTT: gaia.cs.umass.edu to fantasia.eurecom.fr
100
150
200
250
300
350
1 8 15 22 29 36 43 50 57 64 71 78 85 92 99 106
time (seconnds)
RTT
(mill
isec
onds
)
SampleRTT Estimated RTT
![Page 16: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/16.jpg)
TCP Round Trip Time and Timeout
Setting the timeout• EstimtedRTT plus “safety margin”
– large variation in EstimatedRTT -> larger safety margin
• first estimate of how much SampleRTT deviates from EstimatedRTT:
TimeoutInterval = EstimatedRTT + 4*DevRTT
DevRTT = (1-)*DevRTT + *|SampleRTT-EstimatedRTT|
(typically, = 0.25)
Then set timeout interval:
![Page 17: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/17.jpg)
Outline
• Reliable transfer protocols– Pipelined protocols
• Selective repeat
• Connection-oriented transport: TCP– Overview and segment structure– Reliable data transfer– Flow control– Connection management
![Page 18: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/18.jpg)
TCP reliable data transfer
• TCP creates rdt service on top of IP’s unreliable service
• Pipelined segments
• Cumulative acks
• TCP uses single retransmission timer
• Retransmissions are triggered by:– timeout events– duplicate acks
• Initially consider simplified TCP sender:– ignore duplicate acks– ignore flow control,
congestion control
![Page 19: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/19.jpg)
TCP sender(simplified
)
NextSeqNum = InitialSeqNum SendBase = InitialSeqNum
loop (forever) { switch(event)
event: data received from application above create TCP segment with sequence number NextSeqNum if (timer currently not running) start timer pass segment to IP NextSeqNum = NextSeqNum + length(data)
event: timer timeout retransmit not-yet-acknowledged segment with smallest sequence number start timer
event: ACK received, with ACK field value of y if (y > SendBase) { SendBase = y if (there are currently not-yet-acknowledged segments) start timer }
} /* end of loop forever */
Comment:• SendBase-1: last cumulatively ack’ed byteExample:• SendBase-1 = 71;y= 73, so the rcvrwants 73+ ;y > SendBase, sothat new data is acked
![Page 20: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/20.jpg)
TCP: retransmission scenarios
Host A
Seq=100, 20 bytes data
ACK=100
timepremature timeout
Host B
Seq=92, 8 bytes data
ACK=120
Seq=92, 8 bytes data
Seq=
92
tim
eout
ACK=120
Host A
Seq=92, 8 bytes data
ACK=100
loss
tim
eout
lost ACK scenario
Host B
X
Seq=92, 8 bytes data
ACK=100
time
Seq=
92
tim
eout
SendBase= 100
SendBase= 120
SendBase= 120
Sendbase= 100
![Page 21: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/21.jpg)
TCP retransmission scenarios (more)
Host A
Seq=92, 8 bytes data
ACK=100
loss
tim
eout
Cumulative ACK scenario
Host B
X
Seq=100, 20 bytes data
ACK=120
time
SendBase= 120
![Page 22: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/22.jpg)
TCP ACK generation [RFC 1122, RFC 2581]
Event at Receiver
Arrival of in-order segment withexpected seq #. All data up toexpected seq # already ACKed
Arrival of in-order segment withexpected seq #. One other segment has ACK pending
Arrival of out-of-order segmenthigher-than-expect seq. # .Gap detected
Arrival of segment that partially or completely fills gap
TCP Receiver action
Delayed ACK. Wait up to 500msfor next segment. If no next segment,send ACK
Immediately send single cumulative ACK, ACKing both in-order segments
Immediately send duplicate ACK, indicating seq. # of next expected byte
Immediate send ACK, provided thatsegment startsat lower end of gap
![Page 23: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/23.jpg)
Fast Retransmit
• Time-out period often relatively long:– long delay before
resending lost packet
• Detect lost segments via duplicate ACKs.– Sender often sends
many segments back-to-back
– If segment is lost, there will likely be many duplicate ACKs.
• If sender receives 3 ACKs for the same data, it supposes that segment after ACKed data was lost:– fast retransmit: resend
segment before timer expires
![Page 24: Announcement Project 2 out –Much harder than project 1, start early! Homework 2 due next Tu.](https://reader034.fdocuments.us/reader034/viewer/2022052603/56649d575503460f94a354f0/html5/thumbnails/24.jpg)
event: ACK received, with ACK field value of y if (y > SendBase) { SendBase = y if (there are currently not-yet-acknowledged segments) start timer } else { increment count of dup ACKs received for y if (count of dup ACKs received for y = 3) { resend segment with sequence number y }
Fast retransmit algorithm:
a duplicate ACK for already ACKed segment
fast retransmit