Professional Documents
Culture Documents
MObile TCP - Udd
MObile TCP - Udd
MObile TCP - Udd
Prepared by
Dr Mrs U D Dalal
Associate Prof.,ECED, SVNIT
1
Wireless Technologies
2
Transmission Control Protocol / Internet Protocol
TCP/IP
3
Through Internet Protocol (IP)…..
4
Port
5
Transmission Control Protocol (TCP)
6
UDP Header
7
TCP Header
8
9
TCP provides Data Delivery mechanism for
Data Streams
Stream consists of bytes. The number of bytes in a stream is
equal to TPDU that are placed in a memory buffer
Streams are delivered using virtual connection between sockets.
Each socket has a port number and an IP address for rendering
service to an application.
At an IP address there can be sockets for
HTTP application data streams
FTP stream
SMTP data stream
etc.
Each has an assigned port number as per IETF
10
Strategies
The port numbers are divided into three ranges: the
Well Known Ports, the Registered Ports, and the
Dynamic and/or Private Ports.
12
TCP Termination
16
17
18
TCP Data Flow Control
Need of retransmissions
Handled as follows:
1. Window size adjustment (TCP Tuning)
2. Cumulative ACK
3. reverse packet ACK
4. Duplicate ACK
5. Delayed ACK
19
TCP tuning
20
Session between browser (receiver) and server
(sender) with sub segments
21
Comments
22
Cumulative Acknowledgements
The receiver acknowledges all the bytes received
upto a sequence number defined in the ack field. A
new cumulative acknowledgement is generated only
on receipt of a new in-sequence packet.
40 39 38 37
33 34 35 36
41 40 39 38
34 35 36 37
i data i ack 23
Duplicate Acknowledgements
40 39 38 37
34 36
42 41 40 39
36 36
Dupack
On receipt of 38 24
(Above example assumes delayed acks)
Duplicate ACK
25
Duplicate Acknowledgements
Duplicate acks are not delayed
Duplicate acks may be generated when
a packet is lost, or
a packet is delivered out-of-order (OOO)
40 39 37 38
34 36
41 40 39 37
36 36
Dupack
On receipt of 38 26
Number of dupacks depends on how much
OOO a packet is
40 39 37 38
34 36
New Ack New Ack
41 40 39 37
34 36 36
42 41 40 39
36 36 38
40 39 38 37
33 35
41 40 39 38
35 37
28
Window Based Flow Control
Sender’s window
1 2 3 4 5 6 7 8 9 10 11 12 13
Sender’s window
1 2 3 4 5 6 7 8 9 10 11 12 13
Ack 5
1 2 3 4 5 6 7 8 9 10 11 12 13
Sender’s window 30
Window Based Flow Control
31
How does TCP detect a packet loss?
2. Duplicate acknowledgements
32
Detecting Packet Loss Using Dupacks
(Fast Retransmit Mechanism is better)
Dupacks may be generated due to
packet loss, or
out-of-order packet delivery
Fast retransmission
34
Congestion Avoidance and Control
Slow Start
initially, congestion window size cwnd = 1 MSS
36
Congestion
14 avoidance
12
Congestion Window size
10
(segments)
8 Slow start
6 threshold
Slow start
4
2
0
0 1 2 3 4 5 6 7 8
Time (round trips)
38
Congestion Control -- Timeout
39
Congestion window (segments) After timeout
25
cwnd = 20
20
15
10
ssthresh = 8 ssthresh = 10
5
0
12
15
22
25
0
20
Time (round trips)
40
Congestion Control - Fast retransmit
41
Fast Recovery
ssthresh =
min(cwnd, receiver’s advertised window)/2 (at least 2
MSS)
retransmit the missing segment (fast retransmit)
cwnd = ssthresh + number of dupacks
when a new ack comes: cwnd = ssthreh
enter congestion avoidance
42
After fast recovery
10
Receiver’s advertized window
8
Window size (segments)
6
4
2
0
44
45
Fast Recovery
Fast recovery can result in a timeout with multiple losses per
RTT
.
TCP New-Reno [Hoe96]
stay in fast recovery until all packet losses in window are recovered
can recover 1 packet loss per RTT without causing
a timeout
46
Impact of transmission errors
on TCP performance
47
Tutorial Outline
Wireless technologies
TCP basics
Impact of transmission errors on TCP performance
Approaches to improve TCP performance
Classification
Discussion of selected approaches
48
Random Errors
49
Random Errors May Cause Fast Retransmit
40 39 38 37
34 36
50
Random Errors May Cause Fast Retransmit
41 40 39 38
34 36
51
Random Errors May Cause Fast Retransmit
42 41 40 39
36 36
dupack
52
Random Errors May Cause Fast Retransmit
43 42 41 40
36 36 36
Duplicate acks
53
Random Errors May Cause Fast Retransmit
44 43 42 41
36 36 36
54
Random Errors May Cause Fast Retransmit
55
Sometimes Congestion Response May be
Appropriate in Response to Errors
57
Impact of Random Errors [Vaidya99]
1600000
1200000
800000 bits/sec
400000
0
16384 32768 65536 131072
1/error rate (in bytes)
59
Burst Errors May Cause Timeouts
60
Random Errors May Also Cause Timeout
61
Impact of Transmission Errors
62
Tutorial Outline
Wireless technologies
TCP basics
Impact of transmission errors on TCP performance
Approaches to improve TCP performance
Classification
Discussion of selected approaches
63
Classification of Schemes to
Improve Performance of TCP in
Presence of Transmission Errors
64
Techniques to Improve TCP Performance
in Presence of Errors
Classification 1
65
Techniques to Improve TCP Performance
in Presence of Errors
Classification 2
66
Ideal Behavior
67
Tutorial Outline
Wireless technologies
TCP basics
Impact of transmission errors on TCP performance
Approaches to improve TCP performance
Classification
Discussion of selected approaches
68
Selected Schemes to
Improve Performance of TCP in
Presence of Transmission Errors
69
Caveat
70
Various Schemes
71
Link Level Mechanisms
72
Link Layer Mechanisms
Forward Error Correction
73
Link Layer Mechanisms
Link Level Retransmissions
74
Link Layer Mechanisms
In general
75
Link Level Retransmissions
Link layer state
TCP connection
wireless
76
Link Level Retransmissions
Issues
How many times to retransmit at the link level before
giving up?
Finite bound -- semi-reliable link layer
No bound -- reliable link layer
78
Link Level Retransmissions
Issues
Receiver 1
79
Link Level Retransmissions
Issues
Receiver 1
80
Link Level Retransmissions
An Early Study [DeSimone93]
Wireless
Packet loss
RTT sample
RTO
82
A More Accurate Picture
83
Link Level Retransmissions
A More Accurate Picture
84
Link-Layer Retransmissions
A More Accurate Picture [Ludwig98]
data ack
1 2
Timeout = RTO
Reset, Timeout = RTO
86
Link Level Retransmissions
Selective repeat protocols can deliver packets out of
order
6 2 5 4 3 2 1 87
Link Level Retransmissions
In-order delivery
6 5 4 3 2 2 1
6 5 2 4 3 2 1
88
Link Level Retransmissions
In-order delivery
89
Adaptive Link Layer Strategies
[Lettieri98,Eckhardt98,Zorzi97]
FEC code
retransmission limit
frame size
90
Link Layer Retransmissions [Vaidya99]
2000000
1600000
base TCP
1200000
800000 Link layer
retransmission
400000
0
16384
32768
65536
1E+05
20 ms 1 ms
1/error rate (in bytes)
10 Mbps 2 Mbps
and
92
Link Layer Schemes: Classification
93
Various Schemes
94
Split Connection Approach
95
Split Connection Approach
96
Split Connection Approach
FH BS MH
FH BS MH
wireless 99
Split Connection Approach
Indirect TCP [Bakre95,Bakre97]
100
Split Connection Approach
Selective Repeat Protocol (SRP) [Yavatkar94]
101
Split Connection Approach : Other Variations
102
Split Connection Approach : Other Variations
104
Split Connection Approach : Advantages
BS-MH connection can be optimized independent of FH-
BS connection
Different flow / error control on the two connections
105
Split Connection Approach : Disadvantages
39
40
38 37
FH BS MH
40 36
106
Split Connection Approach : Disadvantages
39
40
38 37
FH BS MH
40 36
107
Split Connection Approach : Disadvantages
39
40 MH Hand-off
108
New base station
Split Connection Approach : Disadvantages
109
Split Connection Approach : Disadvantages
FH MH
110
ack
Various Schemes
111
TCP-Aware Link Layer
112
Snoop Protocol [Balakrishnan95acm]
113
Snoop Protocol
TCP connection
FH BS MH
wireless
114
Snoop Protocol
FH BS MH
115
Snoop : Example
35 TCP state
maintained at
36
link layer
37
38
40 39 38 37
FH BS MH
34 36
116
Snoop : Example
35 39
36
37
38
41 40 39 38
34 36
117
Snoop : Example
37 40
38
39
42 41 40 39
36 36
dupack
118
Snoop : Example
37 40
38 41
39
43 42 41 40
36 36 36
Duplicate acks
119
Snoop : Example
37 40
38 41
39 42
44 43 37 41
FH BS MH
36 36
Discard
dupack
Dupack triggers retransmission 36
of packet 37 from base station
BS needs to be TCP-aware to
be able to interpret TCP headers 120
Snoop : Example
37 40 43
38 41
39 42
45 44 42 37
36 36
36
36
121
Snoop : Example
37 40 43
38 41 44
39 42
46 45 43 42
36 41
36
122
Snoop : Example
37 40 43
38 41 44
39 42 45
47 46 44 43
41
36 36
123
Snoop : Example
42 45
43 46
44
48 47 45 44
FH BS MH
41 43
36 36
36 36
124
Snoop [Balakrishnan95acm]
2000000
1600000
bits/sec
400000
0
16K
32K
64K
128K
256K
no error
1/error rate (in bytes)
127
Snoop Protocol : Advantages
128
Snoop Protocol : Disadvantages
129
WTCP Protocol [Ratnam98]
FH BS MH
130
WTCP Protocol
131
WTCP Example
3 3
FH BS MH
4 3
132
WTCP : Disadvantages
134
TCP-Unaware Approximation of
TCP-Aware Link Layer
135
Delayed Dupacks Protocol [Mehta98,Vaidya99]
wireless
137
Delayed Dupacks Protocol
Link layer retransmission scheme at the base station
With OOO link layer delivery, loss of a packet from one flow
does not block delivery of packets from another flow
140
Delayed Dupacks : Example
35
Link layer state
36
37
38
40 39 38 37
34 36
37
38
39
41 40 39 38
BS
34 36
37 40
38
39
42 41 40 39
36 36
dupack
143
Delayed Dupacks : Example
37 40
38 41
39
43 42 41 40
36 36 36
144
Delayed Dupacks : Example
37
39 41
40 42
44 43 37 41
36 36
36
dupack dupacks
Delayed
dupack
Base station forwards dupacks
145
Delayed Dupacks : Example
37 42
40 43
41
45 44 42 37
36 36
36
dupacks 36
Delayed dupacks
146
Delayed Dupacks : Example
37 43
41 44
42
46 45 43 42
36 41
32768
65536
1E+05
1/error rate (in bytes) 20 ms 20 ms
10 Mbps 2 Mbps
32768
65536
1E+05
1/error rate (in bytes) 20 ms 20 ms
10 Mbps 2 Mbps
150
Delayed Dupacks Scheme : Disadvantages
151
Various Schemes
Link-layer retransmissions
Split connection approach
TCP-Aware link layer
TCP-Unaware approximation of TCP-aware link layer
Explicit notification
Receiver-based discrimination
Sender-based discrimination
152
Explicit Notification
153
Explicit Notification Schemes
General Philosophy
154
Explicit Notification Schemes
155
Explicit Notification
Space Communication Protocol Standards-
Transport Protocol (SCPS-TP)
Satellite
wireless
TCP destinations
Ground station
156
Space Communication Protocol Standards-
Transport Protocol (SCPS-TP)
The receiving ground station keeps track of how many
packets with errors are received (their checksums failed)
When the error rate exceeds a threshold, the ground
station sends corruption experienced messages to
destinations of recent error-free TCP packets
destinations are cached
The TCP destinations tag acks with corruption-
experienced bit
TCP sender, after receiving an ack with corruption-
experienced bit, does not back off until it receives an ack
without that bit (even if timeout or fast retransmit occurs)
157
Explicit Loss Notification [Balakrishnan98]
when MH is the TCP sender
Wireless link first on the path from sender to receiver
The base station keeps track of holes in the packet
sequence received from the sender
When a dupack is received from the receiver, the
base station compares the dupack sequence number
with the recorded holes
if there is a match, an ELN bit is set in the dupack
When sender receives dupack with ELN set, it
retransmits packet, but does not reduce congestion
window Record
hole at 2
4 3 2 1 4 3 1
MH BS FH
wireless 1 1 1 1 158
Dupack with ELN set
Explicit Bad State Notification [Bakshi97]
when MH is TCP receiver
159
Partial Ack Protocols
[Cobb95][Biaz97]
Send two types of acknowledgements
A partial acknowledgement informs the sender that a
packet was received by an intermediate host
(typically, base station)
Normal TCP cumulative ack needed by the sender for
reliability purposes
160
Partial Ack Protocols
37
37 36
161
Variations
37
37 36
162
Explicit Loss Notification [Biaz99thesis]
when MH is TCP receiver
Attempts to approximate hypothetical ELN proposed
in [Balakrishnan96] for the case when MH is receiver
Sequence numbers 39
cached at base station
38
37
39 38 37
36 37 37
164
Various Schemes
Link-layer retransmissions
Split connection approach
TCP-Aware link layer
TCP-Unaware approximation of TCP-aware link layer
Explicit notification
Receiver-based discrimination
Sender-based discrimination
165
Receiver-Based Discrimination Scheme
166
Receiver-Based Scheme [Biaz98Asset]
MH is TCP receiver
Receiver uses a heuristic to guess cause of packet
loss
When receiver believes that packet loss is due to
errors, it sends a notification to the TCP sender
TCP sender, on receiving the notification, retransmits
the lost packet, but does not reduce congestion
window
167
Receiver-Based Scheme
FH BS MH
12 10
FH BS MH
11
Congestion loss 168
Receiver-Based Scheme
FH BS MH
2T
12 11 10
Error loss
FH BS MH
169
Receiver-Based Scheme
170
Receiver-Based Scheme
Diagnostic Accuracy [Biaz99Asset]
Limited applicability
172
Receiver-Based Scheme : Advantages
173
Various Schemes
Link-layer retransmissions
Split connection approach
TCP-Aware link layer
TCP-Unaware approximation of TCP-aware link layer
Explicit notification
Receiver-based discrimination
Sender-based discrimination
174
Sender-Based Discrimination Scheme
175
Sender-Based Discrimination Scheme
[Biaz98ic3n,Biaz99techrep]
176
Heuristics for Congestion Avoidance
throughput
cliff
knee
RTT
load load
177
Heuristics for Congestion Avoidance
r = [RTT(i)-RTT(i-1)] / [RTT(i)+RTT(i-1)]
w = [W(i)-W(i-1)] / [W(i)+W(i-1)]
179
Heuristics for Congestion Avoidance
Some proposals
Throughput gradient
TG(i) = [T(i) - T(i-1) ] / [ W(i)-W(i-1)]
180
Heuristics for Congestion Avoidance
Some proposals
181
Sender-Based Heuristics
182
Sender-Based Schemes
Diagnostic Accuracy [Biaz99ic3n]
183
Sender-Based Schemes
Diagnostic Accuracy [Biaz99ic3n]
184
Sender-Based Heuristics : Disadvantage
Reason
185
Sender-Based Heuristics : Advantages
186
Why do Statistical Technique Perform Poorly?
The techniques we evaluated use simple statistics on
RTT and window size W to draw conclusions about
state of the network
Unfortunately, correlation between RTT and W is
often weak
Fraction of TCP
connections
188
TCP in Presence of Transmission Errors
Summary
190
TCP Over Satellite
191
TCP over Satellite
192
Problems Addressed by Various Schemes
Long delay
Large delay-bandwidth products
Transmission errors
193
Improving TCP-over-Satellite [Allman98sept]
[IETF-TCPSAT]
194
Larger Initial Window
[Allman98september] [Allman98august]
approximately 4 Kbyte
195
Byte Counting [Allman98august]
196
Space Communications Protocol Standard-
Transport Protocol (SCPS-TP) [Durst96]
Sender makes default assumption about source of
packet loss
default assumption can be set by network manager on a
per-route basis
default assumption can be changed due to explicit feedback
from the network
Congestion control algorithm derived from TCP-
Vegas, to bound window growth, to reduce
congestion-induced losses
197
Space Communications Protocol Standard-
Transport Protocol (SCPS-TP)
During link outage, TCP sender freezes itself, and
resumes when link is restored
outage assumed to occur in both directions simultaneously
ground station can detect outage of incoming link (for
instance, by low signal levels), and infers outage of outgoing
link
ground stations provide link outage information to any
sender that attempts to send packets on the outgoing link
sender does not unnecessarily timeout or retransmit until it is
informed that link has recovered
Selective acknowledgement protocol to recover
losses quickly
198
Satellite Transport Protocol (STP)
[Henderson98]
Uses split connection approach
Protocol on satellite channel different from TCP
selective negative acks when receiver detects losses
no retransmission timer
transmitter periodically requests receiver to ack received
data
reduces reverse channel bandwidth usage when losses are
rare
199
Early Acks
Spoofing
Ground station acks packets
Should take responsibility for delivering packets
Early acks from ground station result in faster congestion
window growth
200
Tutorial Outline
201
Impact of Mobility on TCP Performance
202
Impact of Mobility
203
Impact of Mobility
204
Impact of Mobility
If hand-off visible to IP
Need Mobile IP [Johnson96]
packets may be lost while a new route is being established
reliability despite handoff
We consider this case
205
Mobile IP [Johnson96]
MH Router
S
3
Home
agent
Router Router
1 2
206
Mobile IP [Johnson96]
move
Router
S MH
3
Foreign agent
Home agent
207
Example Hand-Off Procedure
4
Old New
BS 5,6 BS
1
2
3
MH
7
208
Hand-Off Procedure
3. New BS acknowledges the greeting, and begins to
route the MH’s packets
4. New BS informs old BS
5. Old BS changes routing table, to forward any
packets for the MH to the new BS
6. Old BS sends an ack to new BS
7. New BS sends handoff-completion message to MH
4
Old New
BS 5,6 BS
1
2
3
MH
7 209
Mobile IP
210
Hand-off
211
Impact of Handoffs on Schemes to Improves
Performance in Presence of Errors
Split connection approach
hard state at base station must be moved to new base station
Snoop protocol
soft state need not be moved
while the new base station builds new state, packet losses may
not be recovered locally
212
Techniques to
Improve TCP Performance
in Presence of Mobility
213
Classification
214
Using Fast Retransmits to Recover from
Timeouts during Handoff [Caceres95]
Last
timed 1.0
transmit
Four environments
1. No moves
2. Moves (once per 8 sec) between overlapping cells
3. Moves between non-overlapping cells, 0 sec delay
4. Moves between non-overlapping cells, 1 sec delay
218
TCP Performance
es lls l ay ec.
v e s
o c de /1
m
i ng /0 p
No pp
p rla
rla e
rla e o v
e ov -
ov n -
no
n
no
219
TCP Performance
220
Mitigation Using Fast Retransmit
221
0-second Rendezvous Delay
Improvement using Fast Retransmit
Cell crossing Retransmission
Handoff complete
+ beacon timeout
Routes updated
arrives does not occur
Fast retransmit
Last
timed 1.0
transmit
0 0.15 0.8
Packet loss
Idle sender
222
TCP Performance Improvement
1800 1600
1600 1510 1490
1400 1380
1400
1200 1100
1000 Kbit/sec
800 With fast rxmit
600
400
200
0
1 2 3 4
223
TCP Performance Improvement
224
Improving Performance by Smooth Handoffs
[Caceres95]
or
Buffer packets at BS
Discard the packets after a short interval
If handoff occurs before the interval expires, forward the
packets to the new base station
Prevents packet loss on handoff
225
M-TCP [Brown97]
226
M-TCP Uses
TCP Persist Mode
When a new ack is received with receiver’s advertised
window = 0, the sender enters persist mode
FH BS MH
228
M-TCP
FH BS MH
229
M-TCP
230
M-TCP
Mobile
TCP receiver
FH BS MH
232
FreezeTCP [Goff99]
FH BS MH
233
Using Multicast to Improve Handoffs
[Ghai94,Seshan96]
Define a group of base stations including
current cell of a mobile host
cells that the mobile host is likely to visit next
Address packets destined to the mobile host to the
group
Only one base station transmits the packets to the
mobile host
if rest of them buffer the packets, then packet loss minimized
on handoff
234
Using Multicast to Improve Handoffs
235
Using Multicast to Improve Handoffs
236
Tutorial Outline
237
TCP in Mobile Ad Hoc Networks
238
Mobile Ad Hoc Networks (MANET)
239
Mobile Ad Hoc Networks
[IETF-MANET]
Mobility causes route changes
240
TCP in Mobile Ad Hoc Networks
Issues
Route changes due to mobility
Wireless transmission errors
problem compounded with multiple hops
Out-of-order packet delivery
frequent route changes may cause out-of-order delivery
TCP does not perform well if packets are significantly OOO
Multiple access protocol
choice of MAC protocol can impact TCP performance
significantly
Half-duplex radios
cannot send and receive packets simultaneously
changing mode (send or receive) incurs overhead
241
Throughput over Multi-Hop Wireless Paths
[Gerla99]
242
Impact of Multi-Hop Wireless Paths
[Holland99]
1600
1400
1200
1000 TCP
800 Throughtput
600 (Kbps)
400
200
0
1 2 3 4 5 6 7 8 9 10
Number of hops
244
Impact of Mobility
TCP Throughput
2 m/s 10 m/s
Actual throughput
20 m/s 30 m/s
Actual throughput
Ideal throughput
246
Throughput generally degrades with increasing
speed …
Ideal
Average
Throughput
Over
50 runs Actual
Speed (m/s)
247
But not always …
30 m/s
20 m/s
Actual
throughput
No
throughput
No throughput
despite route repair
No throughput
No throughput
despite route repair
D D D
C C C
B B B A
A A
TCP times out after another 2 seconds, and only then resumes.
251
Why Does Throughput Improve?
Higher (double) Speed Scenario
D D D
C C C
B B B A
A A
253
How to Improve Throughput
(Bring Closer to Ideal)
Network feedback
254
Performance Improvement
Ideal throughput
2 m/s speed 255
Performance Improvement
Ideal throughput
256
30 m/s speed
Performance with Explicit Notification
[Holland99]
throughput as a fraction of
1
0.8
Base TCP
0.6
ideal
0
2 10 20 30
mean speed (m/s)
257
Issues
Network Feedback
258
Impact of Caching
260
Why Performance Degrades With Caching
262
Caching and TCP performance
263
Issues
Window Size After Route Repair
264
Issues
RTO After Route Repair
Proposal: new RTO = function of old RTO, old route length, and
new route length
Example: new RTO = old RTO * new route length / old route length
Not evaluated yet
265
Impact of MAC - Delay Variability
266
Impact of MAC - Delay Variability
[Balakrishnan97]
Several techniques may be used to mitigate problem,
based on minimizing ack transmissions
to reduce frequency of send-receive turnaround and
contention between acks and data
Piggybacking link layer acks with data
Sending fewer TCP acks - ack every d-th packet (d
may be chosen dynamically)
• but need to use rate control at sender to reduce
burstiness (for large d)
Ack filtering - Gateway may drop an older ack in the
queue, if a new ack arrives
reduces number of acks that need to be delivered to the
sender
267
Out-of-Order Packet Delivery
Potential solutions:
Avoid OOO delivery by ordering packets before delivering to IP
layer
• can result in variable delay
turn off fast retransmit
• can result in poor performance in presence of congestion
268
Other Topics
269
Header Compression for Wireless Networks
[Degermark96]
In TCP packet stream, most header bits are identical
Van Jacobson’s scheme exploits this observation to compress
headers, by only sending the “delta” between the previous and
current header
Packet losses result in inefficiency, as headers cannot be
reconstructed due to lost information
Packet losses likely on wireless links
[Degermark96] proposes a technique that works well despite
single packet loss
“twice” algorithm
if current packet fails TCP checksum, assume that a single packet is lost
apply delta for the previous packet twice to the current header, and test
checksum again
270
Twice Algorithm : Example
delta 2 delta
271
Channel State Dependent Packet Scheduling
[Bhagwat96]
Head-of-the Line blocking can occur with FIFO (first-
in-first-out) scheduling, if sender attempts to
retransmit packets on a channel in a bad state
M1
Wireless
M1 M2 M2 M3 M1 card
M2
M3
272
Channel State Dependent Packet Scheduling
M1
M1 M1
Wireless
M2 M2 scheduler card
M2
Per
M3
destination
queues
Channel status M3
monitor
273
Channel State Dependent Packet Scheduling
M1
M1 M1
Wireless
M2 M2 scheduler card
M2
Per
M3
destination
queues
Channel status M3
monitor
274
Channel State Dependent Packet Scheduling
M1
M1 M1
Wireless
M2 M2 scheduler card
M2
Per
M3
destination
queues
Channel status M3
monitor
275
Automatic TCP Buffer Tuning [Semke98]
276
Tutorial Outline
277
Issues for Further Investigation
278
Link Layer Protocols
279
End-to-End Techniques
280
Impact of Congestion Losses
281
Multiple TCP Transfers
283
TCP for Mobile Ad Hoc Networks
284
References
285
Thank you !!