Transcript Wireless TCP - ODU Computer Science

Wireless & Mobile Networking
CS 752/852 - Spring 2011
Wireless TCP
Tamer Nadeem
Dept. of Computer Science
The OSI Communication Model
Page 2
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Recall 1: PHY and MAC
MAC
MAC
PHY
PHY
• Spread Spectrum radios (DS and FH)
• RTS/CTS and Carrier Sensing for Hidden Terminals
• Directional antennas to reduce interference
• Rate control to extract max capacity from available SINR
• Power control for spatial reuse & energy savings – topology control
• TDMA scheduling, multi-channel use, encryption security
… and many more
Page 3
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Recall 2: Network Layer
Routing
Routing
Routing
Routing
Routing
• The first view of the network
• Coping up with (uncontrolled) user mobility
-Flooding the network reactively, or proactive updation
• Mobile IP, coping with handoffs, etc.
• Ad hoc routing – discovery, optimal metric, maintenance, caching
• Secure routing – Routes bypassing malicious nodes
Page 4
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Role of Transport Layer
TCP
TCP
NETWORK
• Transport packets quickly and reliably over this network
• Network properties often unknown (or difficult to track)
- Where is the congestion ? How much cross traffic ?
- What is the bottleneck bandwidth ?
- How much buffers at intermediate nodes ?
 Motivation for end to end TCP
Page 5
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Some transmission methods
• Stop & Wait
• Pipelined
• Go Back N
• Selective Repeat
Page 6
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Stop-and-wait operation
sender
receiver
first packet bit transmitted, t = 0
last packet bit transmitted, t = L / R
first packet bit arrives
last packet bit arrives, send ACK
RTT
ACK arrives, send next
packet, t = RTT + L / R
U
Page 7
=
sender
Spring 2011
L/R
RTT + L / R
=
.008
30.008
= 0.00027
microsec
onds
CS 752/852 - Wireless and Mobile Networking
Pipelined protocols
Pipelining: sender allows multiple, “in-flight”, yet-to-beacknowledged pkts
• range of sequence numbers must be increased
• buffering at sender and/or receiver
• Two generic forms of pipelined protocols: go-Back-N, selective
repeat
Page 8
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Pipelining: increased utilization
sender
receiver
first packet bit transmitted, t = 0
last bit transmitted, t = L / R
first packet bit arrives
last packet bit arrives, send ACK
last bit of 2nd packet arrives, send ACK
last bit of 3rd packet arrives, send ACK
RTT
ACK arrives, send next
packet, t = RTT + L / R
Increase utilization
by a factor of 3!
U
Page 9
sender
=
Spring 2011
3*L/R
RTT + L / R
=
.024
30.008
= 0.0008
microsecon
ds
CS 752/852 - Wireless and Mobile Networking
Go-Back-N
Sender:
• k-bit seq # in pkt header
• “window” of up to N, consecutive unack’ed pkts allowed
 ACK(n): ACKs all pkts up to, including seq # n - “cumulative ACK”
 may receive duplicate ACKs
 timer for each in-flight pkt
 timeout(n): retransmit pkt n and all higher seq # pkts in window
Page 10
Spring 2011
CS 752/852 - Wireless and Mobile Networking
GBN in
action
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 12
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Selective repeat: sender, receiver windows
Selective repeat
sender
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 #
receiver
pkt 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-yetreceived pkt
pkt n in [rcvbase-N,rcvbase-1]
 ACK(n)
otherwise:
 ignore
Page 14
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Selective repeat in action
TCP
Page 16
Spring 2011
CS 752/852 - Wireless and Mobile Networking
TCP Congestion Control
• Problem Definition
• How much data should I pump into the network to ensure
• Intermediate router queues not filling up
• Fairness achieved among multiple TCP flows
• Why is this problem difficult?
• TCP cannot have information about the network
• Only TCP receiver can give some feedbacks
Page 17
Spring 2011
CS 752/852 - Wireless and Mobile Networking
The Control Problem
• Two main components in TCP
• Flow Control and Congestion Control
• Flow Control
• If receiver’s bucket filling up, pour less water
• Congestion Control
• Don’t pour too much if there are leaks in intermediate pipes
• Regulate your flow based on how much is leaking out
• Aggressive pouring  calls for retransmission of lost packets
• Conservative pouring  lower e2e capacity
• Challenge: At what rate(t) should you pour ?
Page 18
Spring 2011
CS 752/852 - Wireless and Mobile Networking
The TCP Protocol (in a nutshell)
• T transmits few packets, waits for ACK
• Called slow start
• R acknowledges all packet till seq #i by ACK i (optimizations possible)
• ACK sent out only on receiving a packet
• Can be Duplicate ACK if expected packet not received
• ACK reaches T  indicator of more capacity
• T transmits larger burst of packets (self clocking) … so on
• Burst size increased until packet drops (i.e., DupACK)
• When T gets DupACK or waits for longer than RTO
• Assumes congestion  reduces burst size (congestion window)
Page 19
Spring 2011
CS 752/852 - Wireless and Mobile Networking
TCP Timeline
Host B
Think of a blind
person trying to
stand up in a low
ceiling room
RTT
Host A
Objective:
Don’t bang your
head, but stand
up quickly
time
Page 20
Spring 2011
CS 752/852 - Wireless and Mobile Networking
After RTO timeout
25
cwnd = 20
20
15
10
ssthresh = 10
ssthresh = 8
5
25
22
20
15
12
9
6
3
0
0
Congestion window (segments)
When waited for > RTO
Time (round trips)
Page 21
Spring 2011
CS 752/852 - Wireless and Mobile Networking
The TCP Protocol (in a nutshell)
• DupACK not necessarily indicator of congestion
• Can happen due to out of order (OOO) delivery of packets
• If 3 OOO pkts, then CW need not be cut drastically
• The DupACK packet retransmitted
• Continue with same pace of transmission as before
(fast recovery)
• R advertizes its receiver window in ACKs
• If filling up, T reduces congestion window
Page 22
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Fast Recovery on 3 OOO DupACKs
Window size (segments)
After fast recovery
10
Receiver’s advertized window
8
6
4
2
0
0
2
4
6
8
10 12 14
Time (round trips)
Page 23
Spring 2011
CS 752/852 - Wireless and Mobile Networking
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 24
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Example RTT estimation:
RTT: gaia.cs.umass.edu to fantasia.eurecom.fr
350
RTT (milliseconds)
300
250
200
150
100
1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
time (seconnds)
SampleRTT
Page 25
Spring 2011
Estimated RTT
CS 752/852 - Wireless and Mobile Networking
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:
DevRTT = (1-)*DevRTT +
*|SampleRTT-EstimatedRTT|
(typically,  = 0.25)
Then set timeout interval:
TimeoutInterval = EstimatedRTT + 4*DevRTT
Page 26
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Several flavors of TCP: combines options / optimizations
Reno, Vegas, Eifel, Westwood …
Overall TCP has worked well – proven on the internet
Then why study it again
for wireless networks ?
Page 27
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Renewed Challenge
• Key assumption in TCP
• A packet loss is indicative of network congestion
• Source needs to regulate flow by reducing CW
• Assumption closely true for wired networks
• BER ~ 10 -6
• With wireless, errors due to fading, fluctuations
• Need not reduce CW in response …
• But, TCP is e2e  CANNOT see the network
• Thus, TCP cannot classify the cause of loss  CHALLENGE
Page 28
Spring 2011
CS 752/852 - Wireless and Mobile Networking
The Problem Model
TCP connection
application
application
application
transport
transport
transport
network
network
link
link
link
physical
physical
physical
Wireline
Page 29
Spring 2011
rxmt
network
wireless
CS 752/852 - Wireless and Mobile Networking
Impact of Misclassification
2.0E+06
Sequence number (bytes)
Best possible
TCP with no errors
(1.30 Mbps)
1.5E+06
TCP Reno
(280 Kbps)
1.0E+06
5.0E+05
0.0E+00
0
10
20
30
40
50
60
Time (s)
2 MB wide-area TCP transfer over 2 Mbps WaveLAN
Page 30
Spring 2011
CS 752/852 - Wireless and Mobile Networking
The Solution Space
• Much research on TCP over wireless
• Difficult to cover complete ground
• We peek into some of the key ideas
• Link layer mechanisms
• Split connection approach
• TCP-Aware link layer
• TCP-Unaware approximation of TCP-aware link layer
• Explicit notification
• Receiver-based discrimination
• Sender-based discrimination
Page 31
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Link Layer Mechanisms
Page 32
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Link Layer Mechanisms
• Forward error corrections
• Add redundancy in the packets to correct bit-errors
• TCP retransmissions can be alleviated
• Link layer retransmissions
• MAC layer ACKnowledgments
• Overhead only when errors occur (unlike FEC)
Such mechanisms require no change in TCP
Is that breaking e2e argument ??
Page 33
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Issues with Link Layer Mechanisms
• Link layer cannot guarantee reliability
• Have to drop packets after some finite limit
• What is the retransmission limit (??)
• Retransmission can take quite long
• Can be significant fraction of RTT
• TCP can timeout and retransmit the same packet again
• Increasing RTO can avoid this
• But that impacts TCP’s recovery from congestion
• Head of the line blocking
• Link layer has to keep retransmitting even if bad channel
• Blocks other streams
Page 34
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Findings
• Link layer retransmission good
• When channel errors infrequent
• When retransmit time << RTO
• When modifying TCP is not an acceptable solution
Page 35
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Split Connection Approach
Page 36
Spring 2011
CS 752/852 - Wireless and Mobile Networking
1 TCP = ½ TCP + ½ (TCP or XXX)
Per-TCP connection state
TCP connection
TCP connection
application
application
transport
transport
transport
network
network
network
link
link
link
physical
physical
physical
Base
Station
Page 37
Spring 2011
rxmt
application
wireless
CS 752/852 - Wireless and Mobile Networking
Splitting Approaches
• Indirect TCP [Baker97]
• Fixed host (FH) to base station (BS) uses TCP
• BS to mobile host (MH) uses another TCP connection
• Selective Repeat [Yavatkar94]
• Over FH to BS: Use TCP
• Over BS to MH: Use selective repeat on top of UDP
• No congestion control over wireless [Haas97]
• Also use less headers over wireless
• Header compression
Page 38
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Issues with Splitting
• E2E totally broken
• 2 separate connections
• BS maintains hard state for each connection
• What if MH disconnected from BS ?
• Huge buffer requirements at BS
• What if BS fails ?
• Handoff between BS requires state transfer
• What if Data and ACK travel on different routes ?
• BS will not see the ACK at all – splitting not feasible
Page 39
Spring 2011
CS 752/852 - Wireless and Mobile Networking
TCP-Aware Link Layer
Page 40
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop
• Link layer at BS buffers un-acknowledged packets
• Now, BS peeks into every returning TCP ACK from MH
• If DupACK
• Retransmits the necessary packet
• Drops the DupACK
• DupACK does not reach sender
• Prevents fast retransmit
Page 41
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
35
36
TCP state
maintained at
link layer
37
38
40
39
38
FH
37
BS
MH
34
36
Example assumes delayed ack - every other packet ack’d
Page 42
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
35
39
36
37
38
41
40
34
Page 43
Spring 2011
39
38
36
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
37
40
38
39
42
41
40
36
39
36
dupack
Duplicate acks are not delayed
Page 44
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
37
40
38
41
39
43
42
36
41
40
36
36
Duplicate acks
Page 45
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
44
37
40
38
41
39
42
43
FH
37
41
BS
MH
Discard
dupack
36
36
Dupack triggers retransmission
of packet 37 from base station 36
BS needs to be TCP-aware to
be able to interpret TCP headers
Page 46
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
45
37
40
38
41
39
42
44
43
42
37
36
36
36
36
Page 47
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
46
37
40
43
38
41
44
39
42
45
43
42
36
TCP sender does not
fast retransmit
41
36 36
36
Page 48
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
47
37
40
43
38
41
44
39
42
45
46
44
43
41
TCP sender does not
fast retransmit
36 36
36 36
Page 49
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop : Example
42
45
43
46
44
48
47
45
FH
44
BS
MH
41
43
36 36
36 36
Page 50
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Snoop [Balakrishnan95acm]
bits/sec
2000000
1600000
1200000
base TCP
Snoop
800000
400000
0
no error
256K
128K
64K
32K
16K
1/error rate
(in bytes)
2 Mbps Wireless link
Page 51
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Issues with Snoop
• Link layer needs to be TCP aware
• Smelling cross layer
• Link layer needs to buffer and perform sliding window
• Not useful when TCP headers encrypted
• Not feasible when Data and ACK travel different routes
• RTT estimates can still go up due to link layer retransmission
• Affects performance of Snoop
Page 52
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Wireless TCP
• WTCP attempts to nullify RTT estimation problem
• When data packets are lost due to errors
• Link layer includes own time stamp in ACK packet
• ACK packets that have BS time stamps indicate a wireless loss
• RTT of these packets not considered for RTO calculation
• But then, what if wireless hop is also congested !!!!!!
• Time stamping cannot take care of that 
Page 53
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Quick look at other schemes
TCP-unaware schemes
Explicit notification
Receiver-based
Page 54
Spring 2011
CS 752/852 - Wireless and Mobile Networking
TCP-Unaware, ELN
• Delayed DupACKs
• Receiver waits for sometime before sending DupACK
• If link retransmission solves problem
• Then TCP sender does not send redundant packet
• Explicit Loss Notification (ELN)
• BS remembers only packet’s sequence numbers
• When DupACKs return through them, they check
• If packet was received by BS, then colors the DupACK
• Sender realizes that packet lost on wireless link
• Does not cut down CW, just retransmits that packet
Page 55
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Closing Thoughts
• Reliable and in-order packet delivery important
• TCP aims to support these features
• Implements congestion control and flow control
• TCP widely tuned for wireline networks
• Proven to be efficient on the internet
• When network periphery has wireless “last mile”
• TCP exhibits myriad problems
• Mainly because of
“misclassification between congestion and channel errors”
• Several solution approaches  but many open problems
Page 56
Spring 2011
CS 752/852 - Wireless and Mobile Networking
What’s Hot Now ??
• TCP over wireless multihop (mesh)
• Each hop has contention-based MAC
• Unpredictable delays and congestion
• Fairness between TCP e2e flows a very challenging problem
• Mobility can significantly affect TCP
(Very difficult set of open problems)
• More fundamental: Is TCP the way to go for wireless
• Strong ongoing debate in community
• Useful queuing solutions in ad hoc networks
• Neighborhood RED solution
… and many many more …
Page 57
Spring 2011
CS 752/852 - Wireless and Mobile Networking
Questions ?
Page 58
Spring 2011
CS 752/852 - Wireless and Mobile Networking