1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
|
/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/*
* Copyright (c) 1990, 1997 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* advertising materials, and other materials related to such
* distribution and use acknowledge that the software was developed
* by the University of California, Lawrence Berkeley Laboratory,
* Berkeley, CA. The name of the University may not be used to
* endorse or promote products derived from this software without
* specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
#ifndef lint
static const char rcsid[] =
"@(#) $Header: /cvsroot/nsnam/ns-2/tcp/tcp-newreno.cc,v 1.58 2009/12/30 22:06:34 tom_henderson Exp $ (LBL)";
#endif
//
// newreno-tcp: a revised reno TCP source, without sack
//
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include "packet.h"
#include "ip.h"
#include "tcp.h"
#include "flags.h"
static class NewRenoTcpClass : public TclClass {
public:
NewRenoTcpClass() : TclClass("Agent/TCP/Newreno") {}
TclObject* create(int, const char*const*) {
return (new NewRenoTcpAgent());
}
} class_newreno;
NewRenoTcpAgent::NewRenoTcpAgent() : newreno_changes_(0),
newreno_changes1_(0), acked_(0), firstpartial_(0),
partial_window_deflation_(0), exit_recovery_fix_(0)
{
bind("newreno_changes_", &newreno_changes_);
bind("newreno_changes1_", &newreno_changes1_);
bind("exit_recovery_fix_", &exit_recovery_fix_);
bind("partial_window_deflation_", &partial_window_deflation_);
}
/*
* Process a packet that acks previously unacknowleges data, but
* does not take us out of Fast Retransmit.
*/
void NewRenoTcpAgent::partialnewack(Packet* pkt)
{
hdr_tcp *tcph = hdr_tcp::access(pkt);
if (partial_window_deflation_) {
// Do partial window deflation before resetting last_ack_
unsigned int deflate = 0; // Should initialize it?? - haoboy
if (tcph->seqno() > last_ack_) // assertion
deflate = tcph->seqno() - last_ack_;
else
printf("False call to partialnewack: deflate %u \
last_ack_ %d\n", deflate, last_ack_);
if (dupwnd_ > deflate)
dupwnd_ -= (deflate - 1);
else {
cwnd_ -= (deflate - dupwnd_);
// Leave dupwnd_ > 0 to flag "fast recovery" phase
dupwnd_ = 1;
}
if (cwnd_ < 1) {cwnd_ = 1;}
}
last_ack_ = tcph->seqno();
highest_ack_ = last_ack_;
if (t_seqno_ < last_ack_ + 1)
t_seqno_ = last_ack_ + 1;
if (rtt_active_ && tcph->seqno() >= rtt_seq_) {
rtt_active_ = 0;
t_backoff_ = 1;
}
}
void NewRenoTcpAgent::partialnewack_helper(Packet* pkt)
{
if (!newreno_changes1_ || firstpartial_ == 0) {
firstpartial_ = 1;
/* For newreno_changes1_,
* only reset the retransmit timer for the first
* partial ACK, so that, in the worst case, we
* don't have to wait for one packet retransmitted
* per RTT.
*/
newtimer(pkt);
}
partialnewack(pkt);
output(last_ack_ + 1, 0);
}
int
NewRenoTcpAgent::allow_fast_retransmit(int /* last_cwnd_action_*/)
{
return 0;
}
void
NewRenoTcpAgent::dupack_action()
{
int recovered = (highest_ack_ > recover_);
int recovered1 = (highest_ack_ == recover_);
int allowFastRetransmit = allow_fast_retransmit(last_cwnd_action_);
if (recovered || (!bug_fix_ && !ecn_) || allowFastRetransmit
|| (bugfix_ss_ && highest_ack_ == 0)) {
// (highest_ack_ == 0) added to allow Fast Retransmit
// when the first data packet is dropped.
// Bug report from Mark Allman.
goto reno_action;
}
if (bug_fix_ && less_careful_ && recovered1) {
/*
* For the Less Careful variant, allow a Fast Retransmit
* if highest_ack_ == recover.
* RFC 2582 recommends the Careful variant, not the
* Less Careful one.
*/
goto reno_action;
}
if (ecn_ && last_cwnd_action_ == CWND_ACTION_ECN) {
last_cwnd_action_ = CWND_ACTION_DUPACK;
/*
* What if there is a DUPACK action followed closely by ECN
* followed closely by a DUPACK action?
* The optimal thing to do would be to remember all
* congestion actions from the most recent window
* of data. Otherwise "bugfix" might not prevent
* all unnecessary Fast Retransmits.
*/
reset_rtx_timer(1,0);
output(last_ack_ + 1, TCP_REASON_DUPACK);
dupwnd_ = numdupacks_;
return;
}
if (bug_fix_) {
if (bugfix_ts_ && tss[highest_ack_ % tss_size_] == ts_echo_)
goto reno_action;
else if (bugfix_ack_ && cwnd_ > 1 && highest_ack_ - prev_highest_ack_ <= numdupacks_)
goto reno_action;
else
/*
* The line below, for "bug_fix_" true, avoids
* problems with multiple fast retransmits in one
* window of data.
*/
return;
}
reno_action:
recover_ = maxseq_;
reset_rtx_timer(1,0);
if (!lossQuickStart()) {
trace_event("NEWRENO_FAST_RETX");
last_cwnd_action_ = CWND_ACTION_DUPACK;
slowdown(CLOSE_SSTHRESH_HALF|CLOSE_CWND_HALF);
output(last_ack_ + 1, TCP_REASON_DUPACK); // from top
dupwnd_ = numdupacks_;
}
return;
}
void NewRenoTcpAgent::recv(Packet *pkt, Handler*)
{
hdr_tcp *tcph = hdr_tcp::access(pkt);
int valid_ack = 0;
/* Use first packet to calculate the RTT --contributed by Allman */
if (qs_approved_ == 1 && tcph->seqno() > last_ack_)
endQuickStart();
if (qs_requested_ == 1)
processQuickStart(pkt);
if (++acked_ == 1)
basertt_ = Scheduler::instance().clock() - firstsent_;
/* Estimate ssthresh based on the calculated RTT and the estimated
bandwidth (using ACKs 2 and 3). */
else if (acked_ == 2)
ack2_ = Scheduler::instance().clock();
else if (acked_ == 3) {
ack3_ = Scheduler::instance().clock();
new_ssthresh_ = int((basertt_ * (size_ / (ack3_ - ack2_))) / size_);
if (newreno_changes_ > 0 && new_ssthresh_ < ssthresh_)
ssthresh_ = new_ssthresh_;
}
#ifdef notdef
if (pkt->type_ != PT_ACK) {
fprintf(stderr,
"ns: confiuration error: tcp received non-ack\n");
exit(1);
}
#endif
/* W.N.: check if this is from a previous incarnation */
if (tcph->ts() < lastreset_) {
// Remove packet and do nothing
Packet::free(pkt);
return;
}
++nackpack_;
ts_peer_ = tcph->ts();
if (hdr_flags::access(pkt)->ecnecho() && ecn_)
ecn(tcph->seqno());
recv_helper(pkt);
recv_frto_helper(pkt);
if (tcph->seqno() > last_ack_) {
if (tcph->seqno() >= recover_
|| (last_cwnd_action_ != CWND_ACTION_DUPACK)) {
if (dupwnd_ > 0) {
dupwnd_ = 0;
if (last_cwnd_action_ == CWND_ACTION_DUPACK)
last_cwnd_action_ = CWND_ACTION_EXITED;
if (exit_recovery_fix_) {
int outstanding = maxseq_ - tcph->seqno() + 1;
if (ssthresh_ < outstanding)
cwnd_ = ssthresh_;
else
cwnd_ = outstanding;
}
}
firstpartial_ = 0;
recv_newack_helper(pkt);
if (last_ack_ == 0 && delay_growth_) {
cwnd_ = initial_window();
}
} else {
/* received new ack for a packet sent during Fast
* Recovery, but sender stays in Fast Recovery */
if (partial_window_deflation_ == 0)
dupwnd_ = 0;
partialnewack_helper(pkt);
}
} else if (tcph->seqno() == last_ack_) {
if (hdr_flags::access(pkt)->eln_ && eln_) {
tcp_eln(pkt);
return;
}
if (++dupacks_ == numdupacks_) {
dupack_action();
if (!exitFastRetrans_)
dupwnd_ = numdupacks_;
} else if (dupacks_ > numdupacks_ && (!exitFastRetrans_
|| last_cwnd_action_ == CWND_ACTION_DUPACK)) {
trace_event("NEWRENO_FAST_RECOVERY");
++dupwnd_; // fast recovery
/* For every two duplicate ACKs we receive (in the
* "fast retransmit phase"), send one entirely new
* data packet "to keep the flywheel going". --Allman
*/
if (newreno_changes_ > 0 && (dupacks_ % 2) == 1)
output (t_seqno_++,0);
} else if (dupacks_ < numdupacks_ && singledup_ ) {
send_one();
}
}
if (tcph->seqno() >= last_ack_)
// Check if ACK is valid. Suggestion by Mark Allman.
valid_ack = 1;
Packet::free(pkt);
#ifdef notyet
if (trace_)
plot();
#endif
/*
* Try to send more data
*/
if (valid_ack || aggressive_maxburst_)
{
if (dupacks_ == 0)
{
/*
* Maxburst is really only needed for the first
* window of data on exiting Fast Recovery.
*/
send_much(0, 0, maxburst_);
}
else if (dupacks_ > numdupacks_ - 1 && newreno_changes_ == 0)
{
send_much(0, 0, 2);
}
}
}
|