1 |
1275 |
phoenix |
/* SCTP kernel reference Implementation
|
2 |
|
|
* Copyright (c) 1999-2000 Cisco, Inc.
|
3 |
|
|
* Copyright (c) 1999-2001 Motorola, Inc.
|
4 |
|
|
* Copyright (c) 2001-2003 International Business Machines Corp.
|
5 |
|
|
* Copyright (c) 2001 Intel Corp.
|
6 |
|
|
* Copyright (c) 2001 La Monte H.P. Yarroll
|
7 |
|
|
*
|
8 |
|
|
* This file is part of the SCTP kernel reference Implementation
|
9 |
|
|
*
|
10 |
|
|
* This module provides the abstraction for an SCTP tranport representing
|
11 |
|
|
* a remote transport address. For local transport addresses, we just use
|
12 |
|
|
* union sctp_addr.
|
13 |
|
|
*
|
14 |
|
|
* The SCTP reference implementation is free software;
|
15 |
|
|
* you can redistribute it and/or modify it under the terms of
|
16 |
|
|
* the GNU General Public License as published by
|
17 |
|
|
* the Free Software Foundation; either version 2, or (at your option)
|
18 |
|
|
* any later version.
|
19 |
|
|
*
|
20 |
|
|
* The SCTP reference implementation is distributed in the hope that it
|
21 |
|
|
* will be useful, but WITHOUT ANY WARRANTY; without even the implied
|
22 |
|
|
* ************************
|
23 |
|
|
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
24 |
|
|
* See the GNU General Public License for more details.
|
25 |
|
|
*
|
26 |
|
|
* You should have received a copy of the GNU General Public License
|
27 |
|
|
* along with GNU CC; see the file COPYING. If not, write to
|
28 |
|
|
* the Free Software Foundation, 59 Temple Place - Suite 330,
|
29 |
|
|
* Boston, MA 02111-1307, USA.
|
30 |
|
|
*
|
31 |
|
|
* Please send any bug reports or fixes you make to the
|
32 |
|
|
* email address(es):
|
33 |
|
|
* lksctp developers <lksctp-developers@lists.sourceforge.net>
|
34 |
|
|
*
|
35 |
|
|
* Or submit a bug report through the following website:
|
36 |
|
|
* http://www.sf.net/projects/lksctp
|
37 |
|
|
*
|
38 |
|
|
* Written or modified by:
|
39 |
|
|
* La Monte H.P. Yarroll <piggy@acm.org>
|
40 |
|
|
* Karl Knutson <karl@athena.chicago.il.us>
|
41 |
|
|
* Jon Grimm <jgrimm@us.ibm.com>
|
42 |
|
|
* Xingang Guo <xingang.guo@intel.com>
|
43 |
|
|
* Hui Huang <hui.huang@nokia.com>
|
44 |
|
|
* Sridhar Samudrala <sri@us.ibm.com>
|
45 |
|
|
* Ardelle Fan <ardelle.fan@intel.com>
|
46 |
|
|
*
|
47 |
|
|
* Any bugs reported given to us we will try to fix... any fixes shared will
|
48 |
|
|
* be incorporated into the next SCTP release.
|
49 |
|
|
*/
|
50 |
|
|
|
51 |
|
|
#include <linux/types.h>
|
52 |
|
|
#include <net/sctp/sctp.h>
|
53 |
|
|
#include <net/sctp/sm.h>
|
54 |
|
|
|
55 |
|
|
/* 1st Level Abstractions. */
|
56 |
|
|
|
57 |
|
|
/* Allocate and initialize a new transport. */
|
58 |
|
|
struct sctp_transport *sctp_transport_new(const union sctp_addr *addr, int gfp)
|
59 |
|
|
{
|
60 |
|
|
struct sctp_transport *transport;
|
61 |
|
|
|
62 |
|
|
transport = t_new(struct sctp_transport, gfp);
|
63 |
|
|
if (!transport)
|
64 |
|
|
goto fail;
|
65 |
|
|
|
66 |
|
|
if (!sctp_transport_init(transport, addr, gfp))
|
67 |
|
|
goto fail_init;
|
68 |
|
|
|
69 |
|
|
transport->malloced = 1;
|
70 |
|
|
SCTP_DBG_OBJCNT_INC(transport);
|
71 |
|
|
|
72 |
|
|
return transport;
|
73 |
|
|
|
74 |
|
|
fail_init:
|
75 |
|
|
kfree(transport);
|
76 |
|
|
|
77 |
|
|
fail:
|
78 |
|
|
return NULL;
|
79 |
|
|
}
|
80 |
|
|
|
81 |
|
|
/* Initialize a new transport from provided memory. */
|
82 |
|
|
struct sctp_transport *sctp_transport_init(struct sctp_transport *peer,
|
83 |
|
|
const union sctp_addr *addr,
|
84 |
|
|
int gfp)
|
85 |
|
|
{
|
86 |
|
|
/* Copy in the address. */
|
87 |
|
|
peer->ipaddr = *addr;
|
88 |
|
|
peer->af_specific = sctp_get_af_specific(addr->sa.sa_family);
|
89 |
|
|
peer->asoc = NULL;
|
90 |
|
|
|
91 |
|
|
peer->dst = NULL;
|
92 |
|
|
memset(&peer->saddr, 0, sizeof(union sctp_addr));
|
93 |
|
|
|
94 |
|
|
/* From 6.3.1 RTO Calculation:
|
95 |
|
|
*
|
96 |
|
|
* C1) Until an RTT measurement has been made for a packet sent to the
|
97 |
|
|
* given destination transport address, set RTO to the protocol
|
98 |
|
|
* parameter 'RTO.Initial'.
|
99 |
|
|
*/
|
100 |
|
|
peer->rtt = 0;
|
101 |
|
|
peer->rto = sctp_rto_initial;
|
102 |
|
|
peer->rttvar = 0;
|
103 |
|
|
peer->srtt = 0;
|
104 |
|
|
peer->rto_pending = 0;
|
105 |
|
|
|
106 |
|
|
peer->last_time_heard = jiffies;
|
107 |
|
|
peer->last_time_used = jiffies;
|
108 |
|
|
peer->last_time_ecne_reduced = jiffies;
|
109 |
|
|
|
110 |
|
|
peer->active = SCTP_ACTIVE;
|
111 |
|
|
peer->hb_allowed = 0;
|
112 |
|
|
|
113 |
|
|
/* Initialize the default path max_retrans. */
|
114 |
|
|
peer->max_retrans = sctp_max_retrans_path;
|
115 |
|
|
peer->error_threshold = 0;
|
116 |
|
|
peer->error_count = 0;
|
117 |
|
|
|
118 |
|
|
INIT_LIST_HEAD(&peer->transmitted);
|
119 |
|
|
INIT_LIST_HEAD(&peer->send_ready);
|
120 |
|
|
INIT_LIST_HEAD(&peer->transports);
|
121 |
|
|
sctp_packet_init(&peer->packet, peer, 0, 0);
|
122 |
|
|
|
123 |
|
|
/* Set up the retransmission timer. */
|
124 |
|
|
init_timer(&peer->T3_rtx_timer);
|
125 |
|
|
peer->T3_rtx_timer.function = sctp_generate_t3_rtx_event;
|
126 |
|
|
peer->T3_rtx_timer.data = (unsigned long)peer;
|
127 |
|
|
|
128 |
|
|
/* Set up the heartbeat timer. */
|
129 |
|
|
init_timer(&peer->hb_timer);
|
130 |
|
|
peer->hb_interval = SCTP_DEFAULT_TIMEOUT_HEARTBEAT;
|
131 |
|
|
peer->hb_timer.function = sctp_generate_heartbeat_event;
|
132 |
|
|
peer->hb_timer.data = (unsigned long)peer;
|
133 |
|
|
|
134 |
|
|
atomic_set(&peer->refcnt, 1);
|
135 |
|
|
peer->dead = 0;
|
136 |
|
|
|
137 |
|
|
peer->malloced = 0;
|
138 |
|
|
|
139 |
|
|
/* Initialize the state information for SFR-CACC */
|
140 |
|
|
peer->cacc.changeover_active = 0;
|
141 |
|
|
peer->cacc.cycling_changeover = 0;
|
142 |
|
|
peer->cacc.next_tsn_at_change = 0;
|
143 |
|
|
peer->cacc.cacc_saw_newack = 0;
|
144 |
|
|
|
145 |
|
|
return peer;
|
146 |
|
|
}
|
147 |
|
|
|
148 |
|
|
/* This transport is no longer needed. Free up if possible, or
|
149 |
|
|
* delay until it last reference count.
|
150 |
|
|
*/
|
151 |
|
|
void sctp_transport_free(struct sctp_transport *transport)
|
152 |
|
|
{
|
153 |
|
|
transport->dead = 1;
|
154 |
|
|
|
155 |
|
|
/* Try to delete the heartbeat timer. */
|
156 |
|
|
if (del_timer(&transport->hb_timer))
|
157 |
|
|
sctp_transport_put(transport);
|
158 |
|
|
|
159 |
|
|
sctp_transport_put(transport);
|
160 |
|
|
}
|
161 |
|
|
|
162 |
|
|
/* Destroy the transport data structure.
|
163 |
|
|
* Assumes there are no more users of this structure.
|
164 |
|
|
*/
|
165 |
|
|
void sctp_transport_destroy(struct sctp_transport *transport)
|
166 |
|
|
{
|
167 |
|
|
SCTP_ASSERT(transport->dead, "Transport is not dead", return);
|
168 |
|
|
|
169 |
|
|
if (transport->asoc)
|
170 |
|
|
sctp_association_put(transport->asoc);
|
171 |
|
|
|
172 |
|
|
dst_release(transport->dst);
|
173 |
|
|
kfree(transport);
|
174 |
|
|
SCTP_DBG_OBJCNT_DEC(transport);
|
175 |
|
|
}
|
176 |
|
|
|
177 |
|
|
/* Start T3_rtx timer if it is not already running and update the heartbeat
|
178 |
|
|
* timer. This routine is called every time a DATA chunk is sent.
|
179 |
|
|
*/
|
180 |
|
|
void sctp_transport_reset_timers(struct sctp_transport *transport)
|
181 |
|
|
{
|
182 |
|
|
/* RFC 2960 6.3.2 Retransmission Timer Rules
|
183 |
|
|
*
|
184 |
|
|
* R1) Every time a DATA chunk is sent to any address(including a
|
185 |
|
|
* retransmission), if the T3-rtx timer of that address is not running
|
186 |
|
|
* start it running so that it will expire after the RTO of that
|
187 |
|
|
* address.
|
188 |
|
|
*/
|
189 |
|
|
|
190 |
|
|
if (!timer_pending(&transport->T3_rtx_timer))
|
191 |
|
|
if (!mod_timer(&transport->T3_rtx_timer,
|
192 |
|
|
jiffies + transport->rto))
|
193 |
|
|
sctp_transport_hold(transport);
|
194 |
|
|
|
195 |
|
|
/* When a data chunk is sent, reset the heartbeat interval. */
|
196 |
|
|
if (!mod_timer(&transport->hb_timer,
|
197 |
|
|
sctp_transport_timeout(transport)))
|
198 |
|
|
sctp_transport_hold(transport);
|
199 |
|
|
}
|
200 |
|
|
|
201 |
|
|
/* This transport has been assigned to an association.
|
202 |
|
|
* Initialize fields from the association or from the sock itself.
|
203 |
|
|
* Register the reference count in the association.
|
204 |
|
|
*/
|
205 |
|
|
void sctp_transport_set_owner(struct sctp_transport *transport,
|
206 |
|
|
struct sctp_association *asoc)
|
207 |
|
|
{
|
208 |
|
|
transport->asoc = asoc;
|
209 |
|
|
sctp_association_hold(asoc);
|
210 |
|
|
}
|
211 |
|
|
|
212 |
|
|
/* Initialize the pmtu of a transport. */
|
213 |
|
|
void sctp_transport_pmtu(struct sctp_transport *transport)
|
214 |
|
|
{
|
215 |
|
|
struct dst_entry *dst;
|
216 |
|
|
|
217 |
|
|
dst = transport->af_specific->get_dst(NULL, &transport->ipaddr, NULL);
|
218 |
|
|
|
219 |
|
|
if (dst) {
|
220 |
|
|
transport->pmtu = dst_pmtu(dst);
|
221 |
|
|
dst_release(dst);
|
222 |
|
|
} else
|
223 |
|
|
transport->pmtu = SCTP_DEFAULT_MAXSEGMENT;
|
224 |
|
|
}
|
225 |
|
|
|
226 |
|
|
/* Caches the dst entry and source address for a transport's destination
|
227 |
|
|
* address.
|
228 |
|
|
*/
|
229 |
|
|
void sctp_transport_route(struct sctp_transport *transport,
|
230 |
|
|
union sctp_addr *saddr, struct sctp_opt *opt)
|
231 |
|
|
{
|
232 |
|
|
struct sctp_association *asoc = transport->asoc;
|
233 |
|
|
struct sctp_af *af = transport->af_specific;
|
234 |
|
|
union sctp_addr *daddr = &transport->ipaddr;
|
235 |
|
|
struct dst_entry *dst;
|
236 |
|
|
|
237 |
|
|
dst = af->get_dst(asoc, daddr, saddr);
|
238 |
|
|
|
239 |
|
|
if (saddr)
|
240 |
|
|
memcpy(&transport->saddr, saddr, sizeof(union sctp_addr));
|
241 |
|
|
else
|
242 |
|
|
af->get_saddr(asoc, dst, daddr, &transport->saddr);
|
243 |
|
|
|
244 |
|
|
transport->dst = dst;
|
245 |
|
|
if (dst) {
|
246 |
|
|
transport->pmtu = dst_pmtu(dst);
|
247 |
|
|
|
248 |
|
|
/* Initialize sk->sk_rcv_saddr, if the transport is the
|
249 |
|
|
* association's active path for getsockname().
|
250 |
|
|
*/
|
251 |
|
|
if (asoc && (transport == asoc->peer.active_path))
|
252 |
|
|
af->to_sk_saddr(&transport->saddr, asoc->base.sk);
|
253 |
|
|
} else
|
254 |
|
|
transport->pmtu = SCTP_DEFAULT_MAXSEGMENT;
|
255 |
|
|
}
|
256 |
|
|
|
257 |
|
|
/* Hold a reference to a transport. */
|
258 |
|
|
void sctp_transport_hold(struct sctp_transport *transport)
|
259 |
|
|
{
|
260 |
|
|
atomic_inc(&transport->refcnt);
|
261 |
|
|
}
|
262 |
|
|
|
263 |
|
|
/* Release a reference to a transport and clean up
|
264 |
|
|
* if there are no more references.
|
265 |
|
|
*/
|
266 |
|
|
void sctp_transport_put(struct sctp_transport *transport)
|
267 |
|
|
{
|
268 |
|
|
if (atomic_dec_and_test(&transport->refcnt))
|
269 |
|
|
sctp_transport_destroy(transport);
|
270 |
|
|
}
|
271 |
|
|
|
272 |
|
|
/* Update transport's RTO based on the newly calculated RTT. */
|
273 |
|
|
void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt)
|
274 |
|
|
{
|
275 |
|
|
/* Check for valid transport. */
|
276 |
|
|
SCTP_ASSERT(tp, "NULL transport", return);
|
277 |
|
|
|
278 |
|
|
/* We should not be doing any RTO updates unless rto_pending is set. */
|
279 |
|
|
SCTP_ASSERT(tp->rto_pending, "rto_pending not set", return);
|
280 |
|
|
|
281 |
|
|
if (tp->rttvar || tp->srtt) {
|
282 |
|
|
/* 6.3.1 C3) When a new RTT measurement R' is made, set
|
283 |
|
|
* RTTVAR <- (1 - RTO.Beta) * RTTVAR + RTO.Beta * |SRTT - R'|
|
284 |
|
|
* SRTT <- (1 - RTO.Alpha) * SRTT + RTO.Alpha * R'
|
285 |
|
|
*/
|
286 |
|
|
|
287 |
|
|
/* Note: The above algorithm has been rewritten to
|
288 |
|
|
* express rto_beta and rto_alpha as inverse powers
|
289 |
|
|
* of two.
|
290 |
|
|
* For example, assuming the default value of RTO.Alpha of
|
291 |
|
|
* 1/8, rto_alpha would be expressed as 3.
|
292 |
|
|
*/
|
293 |
|
|
tp->rttvar = tp->rttvar - (tp->rttvar >> sctp_rto_beta)
|
294 |
|
|
+ ((abs(tp->srtt - rtt)) >> sctp_rto_beta);
|
295 |
|
|
tp->srtt = tp->srtt - (tp->srtt >> sctp_rto_alpha)
|
296 |
|
|
+ (rtt >> sctp_rto_alpha);
|
297 |
|
|
} else {
|
298 |
|
|
/* 6.3.1 C2) When the first RTT measurement R is made, set
|
299 |
|
|
* SRTT <- R, RTTVAR <- R/2.
|
300 |
|
|
*/
|
301 |
|
|
tp->srtt = rtt;
|
302 |
|
|
tp->rttvar = rtt >> 1;
|
303 |
|
|
}
|
304 |
|
|
|
305 |
|
|
/* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then
|
306 |
|
|
* adjust RTTVAR <- G, where G is the CLOCK GRANULARITY.
|
307 |
|
|
*/
|
308 |
|
|
if (tp->rttvar == 0)
|
309 |
|
|
tp->rttvar = SCTP_CLOCK_GRANULARITY;
|
310 |
|
|
|
311 |
|
|
/* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */
|
312 |
|
|
tp->rto = tp->srtt + (tp->rttvar << 2);
|
313 |
|
|
|
314 |
|
|
/* 6.3.1 C6) Whenever RTO is computed, if it is less than RTO.Min
|
315 |
|
|
* seconds then it is rounded up to RTO.Min seconds.
|
316 |
|
|
*/
|
317 |
|
|
if (tp->rto < tp->asoc->rto_min)
|
318 |
|
|
tp->rto = tp->asoc->rto_min;
|
319 |
|
|
|
320 |
|
|
/* 6.3.1 C7) A maximum value may be placed on RTO provided it is
|
321 |
|
|
* at least RTO.max seconds.
|
322 |
|
|
*/
|
323 |
|
|
if (tp->rto > tp->asoc->rto_max)
|
324 |
|
|
tp->rto = tp->asoc->rto_max;
|
325 |
|
|
|
326 |
|
|
tp->rtt = rtt;
|
327 |
|
|
|
328 |
|
|
/* Reset rto_pending so that a new RTT measurement is started when a
|
329 |
|
|
* new data chunk is sent.
|
330 |
|
|
*/
|
331 |
|
|
tp->rto_pending = 0;
|
332 |
|
|
|
333 |
|
|
SCTP_DEBUG_PRINTK("%s: transport: %p, rtt: %d, srtt: %d "
|
334 |
|
|
"rttvar: %d, rto: %d\n", __FUNCTION__,
|
335 |
|
|
tp, rtt, tp->srtt, tp->rttvar, tp->rto);
|
336 |
|
|
}
|
337 |
|
|
|
338 |
|
|
/* This routine updates the transport's cwnd and partial_bytes_acked
|
339 |
|
|
* parameters based on the bytes acked in the received SACK.
|
340 |
|
|
*/
|
341 |
|
|
void sctp_transport_raise_cwnd(struct sctp_transport *transport,
|
342 |
|
|
__u32 sack_ctsn, __u32 bytes_acked)
|
343 |
|
|
{
|
344 |
|
|
__u32 cwnd, ssthresh, flight_size, pba, pmtu;
|
345 |
|
|
|
346 |
|
|
cwnd = transport->cwnd;
|
347 |
|
|
flight_size = transport->flight_size;
|
348 |
|
|
|
349 |
|
|
/* The appropriate cwnd increase algorithm is performed if, and only
|
350 |
|
|
* if the cumulative TSN has advanced and the congestion window is
|
351 |
|
|
* being fully utilized.
|
352 |
|
|
*/
|
353 |
|
|
if ((transport->asoc->ctsn_ack_point >= sack_ctsn) ||
|
354 |
|
|
(flight_size < cwnd))
|
355 |
|
|
return;
|
356 |
|
|
|
357 |
|
|
ssthresh = transport->ssthresh;
|
358 |
|
|
pba = transport->partial_bytes_acked;
|
359 |
|
|
pmtu = transport->asoc->pmtu;
|
360 |
|
|
|
361 |
|
|
if (cwnd <= ssthresh) {
|
362 |
|
|
/* RFC 2960 7.2.1, sctpimpguide-05 2.14.2 When cwnd is less
|
363 |
|
|
* than or equal to ssthresh an SCTP endpoint MUST use the
|
364 |
|
|
* slow start algorithm to increase cwnd only if the current
|
365 |
|
|
* congestion window is being fully utilized and an incoming
|
366 |
|
|
* SACK advances the Cumulative TSN Ack Point. Only when these
|
367 |
|
|
* two conditions are met can the cwnd be increased otherwise
|
368 |
|
|
* the cwnd MUST not be increased. If these conditions are met
|
369 |
|
|
* then cwnd MUST be increased by at most the lesser of
|
370 |
|
|
* 1) the total size of the previously outstanding DATA
|
371 |
|
|
* chunk(s) acknowledged, and 2) the destination's path MTU.
|
372 |
|
|
*/
|
373 |
|
|
if (bytes_acked > pmtu)
|
374 |
|
|
cwnd += pmtu;
|
375 |
|
|
else
|
376 |
|
|
cwnd += bytes_acked;
|
377 |
|
|
SCTP_DEBUG_PRINTK("%s: SLOW START: transport: %p, "
|
378 |
|
|
"bytes_acked: %d, cwnd: %d, ssthresh: %d, "
|
379 |
|
|
"flight_size: %d, pba: %d\n",
|
380 |
|
|
__FUNCTION__,
|
381 |
|
|
transport, bytes_acked, cwnd,
|
382 |
|
|
ssthresh, flight_size, pba);
|
383 |
|
|
} else {
|
384 |
|
|
/* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh,
|
385 |
|
|
* upon each SACK arrival that advances the Cumulative TSN Ack
|
386 |
|
|
* Point, increase partial_bytes_acked by the total number of
|
387 |
|
|
* bytes of all new chunks acknowledged in that SACK including
|
388 |
|
|
* chunks acknowledged by the new Cumulative TSN Ack and by
|
389 |
|
|
* Gap Ack Blocks.
|
390 |
|
|
*
|
391 |
|
|
* When partial_bytes_acked is equal to or greater than cwnd
|
392 |
|
|
* and before the arrival of the SACK the sender had cwnd or
|
393 |
|
|
* more bytes of data outstanding (i.e., before arrival of the
|
394 |
|
|
* SACK, flightsize was greater than or equal to cwnd),
|
395 |
|
|
* increase cwnd by MTU, and reset partial_bytes_acked to
|
396 |
|
|
* (partial_bytes_acked - cwnd).
|
397 |
|
|
*/
|
398 |
|
|
pba += bytes_acked;
|
399 |
|
|
if (pba >= cwnd) {
|
400 |
|
|
cwnd += pmtu;
|
401 |
|
|
pba = ((cwnd < pba) ? (pba - cwnd) : 0);
|
402 |
|
|
}
|
403 |
|
|
SCTP_DEBUG_PRINTK("%s: CONGESTION AVOIDANCE: "
|
404 |
|
|
"transport: %p, bytes_acked: %d, cwnd: %d, "
|
405 |
|
|
"ssthresh: %d, flight_size: %d, pba: %d\n",
|
406 |
|
|
__FUNCTION__,
|
407 |
|
|
transport, bytes_acked, cwnd,
|
408 |
|
|
ssthresh, flight_size, pba);
|
409 |
|
|
}
|
410 |
|
|
|
411 |
|
|
transport->cwnd = cwnd;
|
412 |
|
|
transport->partial_bytes_acked = pba;
|
413 |
|
|
}
|
414 |
|
|
|
415 |
|
|
/* This routine is used to lower the transport's cwnd when congestion is
|
416 |
|
|
* detected.
|
417 |
|
|
*/
|
418 |
|
|
void sctp_transport_lower_cwnd(struct sctp_transport *transport,
|
419 |
|
|
sctp_lower_cwnd_t reason)
|
420 |
|
|
{
|
421 |
|
|
switch (reason) {
|
422 |
|
|
case SCTP_LOWER_CWND_T3_RTX:
|
423 |
|
|
/* RFC 2960 Section 7.2.3, sctpimpguide-05 Section 2.9.2
|
424 |
|
|
* When the T3-rtx timer expires on an address, SCTP should
|
425 |
|
|
* perform slow start by:
|
426 |
|
|
* ssthresh = max(cwnd/2, 2*MTU)
|
427 |
|
|
* cwnd = 1*MTU
|
428 |
|
|
* partial_bytes_acked = 0
|
429 |
|
|
*/
|
430 |
|
|
transport->ssthresh = max(transport->cwnd/2,
|
431 |
|
|
2*transport->asoc->pmtu);
|
432 |
|
|
transport->cwnd = transport->asoc->pmtu;
|
433 |
|
|
break;
|
434 |
|
|
|
435 |
|
|
case SCTP_LOWER_CWND_FAST_RTX:
|
436 |
|
|
/* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the
|
437 |
|
|
* destination address(es) to which the missing DATA chunks
|
438 |
|
|
* were last sent, according to the formula described in
|
439 |
|
|
* Section 7.2.3.
|
440 |
|
|
*
|
441 |
|
|
* RFC 2960 7.2.3, sctpimpguide-05 2.9.2 Upon detection of
|
442 |
|
|
* packet losses from SACK (see Section 7.2.4), An endpoint
|
443 |
|
|
* should do the following:
|
444 |
|
|
* ssthresh = max(cwnd/2, 2*MTU)
|
445 |
|
|
* cwnd = ssthresh
|
446 |
|
|
* partial_bytes_acked = 0
|
447 |
|
|
*/
|
448 |
|
|
transport->ssthresh = max(transport->cwnd/2,
|
449 |
|
|
2*transport->asoc->pmtu);
|
450 |
|
|
transport->cwnd = transport->ssthresh;
|
451 |
|
|
break;
|
452 |
|
|
|
453 |
|
|
case SCTP_LOWER_CWND_ECNE:
|
454 |
|
|
/* RFC 2481 Section 6.1.2.
|
455 |
|
|
* If the sender receives an ECN-Echo ACK packet
|
456 |
|
|
* then the sender knows that congestion was encountered in the
|
457 |
|
|
* network on the path from the sender to the receiver. The
|
458 |
|
|
* indication of congestion should be treated just as a
|
459 |
|
|
* congestion loss in non-ECN Capable TCP. That is, the TCP
|
460 |
|
|
* source halves the congestion window "cwnd" and reduces the
|
461 |
|
|
* slow start threshold "ssthresh".
|
462 |
|
|
* A critical condition is that TCP does not react to
|
463 |
|
|
* congestion indications more than once every window of
|
464 |
|
|
* data (or more loosely more than once every round-trip time).
|
465 |
|
|
*/
|
466 |
|
|
if ((jiffies - transport->last_time_ecne_reduced) >
|
467 |
|
|
transport->rtt) {
|
468 |
|
|
transport->ssthresh = max(transport->cwnd/2,
|
469 |
|
|
2*transport->asoc->pmtu);
|
470 |
|
|
transport->cwnd = transport->ssthresh;
|
471 |
|
|
transport->last_time_ecne_reduced = jiffies;
|
472 |
|
|
}
|
473 |
|
|
break;
|
474 |
|
|
|
475 |
|
|
case SCTP_LOWER_CWND_INACTIVE:
|
476 |
|
|
/* RFC 2960 Section 7.2.1, sctpimpguide-05 Section 2.14.2
|
477 |
|
|
* When the association does not transmit data on a given
|
478 |
|
|
* transport address within an RTO, the cwnd of the transport
|
479 |
|
|
* address should be adjusted to 2*MTU.
|
480 |
|
|
* NOTE: Although the draft recommends that this check needs
|
481 |
|
|
* to be done every RTO interval, we do it every hearbeat
|
482 |
|
|
* interval.
|
483 |
|
|
*/
|
484 |
|
|
if ((jiffies - transport->last_time_used) > transport->rto)
|
485 |
|
|
transport->cwnd = 2*transport->asoc->pmtu;
|
486 |
|
|
break;
|
487 |
|
|
};
|
488 |
|
|
|
489 |
|
|
transport->partial_bytes_acked = 0;
|
490 |
|
|
SCTP_DEBUG_PRINTK("%s: transport: %p reason: %d cwnd: "
|
491 |
|
|
"%d ssthresh: %d\n", __FUNCTION__,
|
492 |
|
|
transport, reason,
|
493 |
|
|
transport->cwnd, transport->ssthresh);
|
494 |
|
|
}
|
495 |
|
|
|
496 |
|
|
/* What is the next timeout value for this transport? */
|
497 |
|
|
unsigned long sctp_transport_timeout(struct sctp_transport *t)
|
498 |
|
|
{
|
499 |
|
|
unsigned long timeout;
|
500 |
|
|
timeout = t->hb_interval + t->rto + sctp_jitter(t->rto);
|
501 |
|
|
timeout += jiffies;
|
502 |
|
|
return timeout;
|
503 |
|
|
}
|