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
|
/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/*
* Copyright (c) 2000 International Computer Science Institute
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by ACIRI, the AT&T
* Center for Internet Research at ICSI (the International Computer
* Science Institute).
* 4. Neither the name of ACIRI nor of ICSI may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY ICSI AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL ICSI OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*/
#include "pushback-queue.h"
#include "ip.h"
#include "pushback.h"
#include "rate-limit.h"
static class PushbackQueueClass : public TclClass {
public:
PushbackQueueClass() : TclClass("Queue/RED/Pushback") {}
TclObject * create(int argc, const char*const* argv) {
if (argc==4) {
printf("Missing Argument for Pushback Queue Constructor\n");
exit(-1);
}
return (new PushbackQueue(argv[4]));
}
} class_pushback_queue;
PushbackQueue::PushbackQueue(const char* const pba): pushbackID_(-1), src_(-1), dst_(-1),
qmon_(NULL), RLDropTrace_(NULL) {
pushback_ = (PushbackAgent *)TclObject::lookup(pba);
if (pushback_ == NULL) {
printf("Wrong Argument for Pushback Queue Constructor\n");
exit(-1);
}
bind("pushbackID_", &pushbackID_);
bind_bool("rate_limiting_", &rate_limiting_);
verbose_ = pushback_->verbose_;
timer_ = new PushbackQueueTimer(this);
timer_->resched(SUSTAINED_CONGESTION_PERIOD);
rateEstimator_=new RateEstimator();
rlsList_ = new RateLimitSessionList();
if (verbose_) printf("pushback queue instantiated %d\n",pushback_->last_index_);
}
void
PushbackQueue::reportDrop(Packet *p) {
if (debug_)
printf("PBQ:(%d:%d) rate limiting = %d\n", src_, dst_, rate_limiting_);
if (rate_limiting_)
pushback_->reportDrop(pushbackID_, p);
}
int
PushbackQueue::command(int argc, const char*const* argv)
{
Tcl& tcl = Tcl::instance();
if (argc==2) {
if (strcmp(argv[1], "rldrop-trace") == 0) {
if (RLDropTrace_ != NULL) {
tcl.resultf("%s", RLDropTrace_->name());
}
else {
tcl.resultf("0");
}
return (TCL_OK);
}
}
else if (argc == 3) {
if (strcmp(argv[1], "set-monitor") == 0) {
qmon_ = (EDQueueMonitor *)TclObject::lookup(argv[2]);
if (qmon_ == NULL) {
tcl.resultf("Got Invalid Queue Monitor\n");
return TCL_ERROR;
}
return TCL_OK;
}
else if (strcmp(argv[1], "rldrop-trace") == 0) {
RLDropTrace_ = (NsObject *) TclObject::lookup(argv[2]);
if (RLDropTrace_ == NULL) {
if (debug_) printf("Error Attaching Trace\n");
return (TCL_ERROR);
}
if (debug_)
printf("PBQ: RLDropTrace Set to %s\n", RLDropTrace_->name());
return (TCL_OK);
}
} else if (argc == 4) {
if (strcmp(argv[1], "set-src-dst") == 0) {
src_ = atoi(argv[2]);
dst_ = atoi(argv[3]);
if (src_ < 0 || dst_ < 0) {
tcl.resultf("Got Invalid Source or Destination\n");
return TCL_ERROR;
}
return TCL_OK;
}
}
return REDQueue::command(argc, argv);
}
void
PushbackQueue::timeout(int ) {
int barrivals = qmon_->barrivals() - qmon_->mon_ebdrops();
int bdrops = qmon_->bdrops() - qmon_->mon_ebdrops();
int bdeps = qmon_->bdepartures();
// an alternate way of calculating this is using the arrivals and drops from above,
// but the below is more accurate as RED avg queue takes time to come down and
// hence drop rate goes down much slower.
double dropRate1= getDropRate();
double dropRate2= 0;
if (barrivals > 0) {
dropRate2 = (double)bdrops/barrivals;
}
if (dropRate1 > 0 || dropRate2 > 0) {
if (verbose_)
printf("PBQ:(%d:%d) (%g) arrs %d drops %d deps %d mdrops %d dr %g %g\n",
src_, dst_, Scheduler::instance().clock(),
barrivals*8, bdrops*8, bdeps*8, qmon_->mon_ebdrops()*8, dropRate1, dropRate2);
fflush(stdout);
}
Tcl& tcl = Tcl::instance();
tcl.evalf("%s reset",qmon_->name());
if (rate_limiting_ &&
dropRate1 >= SUSTAINED_CONGESTION_DROPRATE &&
dropRate2 >= SUSTAINED_CONGESTION_DROPRATE/2) {
if (verbose_) {
printf("PBQ:(%d:%d) (%g) Arr: %d (%g) Drops: %d (%g %g) BW: %g\n",
src_, dst_, Scheduler::instance().clock(),
barrivals, rateEstimator_->estRate_,
bdrops, dropRate1, dropRate2, link_->bandwidth());
fflush(stdout);
}
// this function call would
// 1) start a rate limiting session,
// 2) insert it in the queues rate limiting session list.
// 3) will also set up appropriate timers.
pushback_->identifyAggregate(pushbackID_, rateEstimator_->estRate_, link_->bandwidth());
}
else if (rlsList_->noMySessions(pushback_->node_->nodeid()) && LOWER_BOUND_MODE == 1) {
pushback_->calculateLowerBound(pushbackID_, rateEstimator_->estRate_);
}
//reset the drop history at the agent
pushback_->resetDropLog(pushbackID_);
timer_->resched(SUSTAINED_CONGESTION_PERIOD);
}
void
PushbackQueue::enque(Packet *p) {
hdr_cmn * hdr = HDR_CMN(p);
if (debug_)
printf("In queue enque with ptype %d %d\n", hdr->ptype(), PT_PUSHBACK);
if (hdr->ptype_ == PT_PUSHBACK) {
if (verbose_) printf("PBQ:(%d:%d). Got a pushback packet.\n",src_, dst_);
q_->enqueHead(p);
return;
}
int dropped = 0;
//set lowDemand to 0 to switch off the low-demand feature.
int qlen = qib_ ? q_->byteLength() : q_->length();
int lowDemand = (edv_.v_ave < edp_.th_min || qlen < 1 || getDropRate() < 0.1*TARGET_DROPRATE );
// lowDemand = 0;
//this would
// 1. check to see if a packet belongs to any of the aggregate being rate-limited
// 2. if yes, log the packet and
// 3. drop it if necessary (based on rate-limiting dynamics).
// 4. dropped = 1, if dropped.
if (rlsList_->noSessions_)
dropped = rlsList_->filter(p, lowDemand);
if (dropped) {
//first trace the monitored early drop
if (RLDropTrace_!= NULL)
((Trace *)RLDropTrace_)->recvOnly(p);
qmon_->mon_edrop(p);
//this is buggy.
//this drop is not recorded by any other monitor attached to the link.
Packet::free(p);
return;
}
//estimate rate only for enqued packets (insignificant bw of pushback messages).
//also counts packet not dropped because of low demand (minor effects to overall demand calculations I believe).
rateEstimator_->estimateRate(p);
REDQueue::enque(p);
}
double
PushbackQueue::getRate() {
return rateEstimator_->estRate_;
}
double
PushbackQueue::getBW() {
return link_->bandwidth();
}
double
PushbackQueue::getDropRate() {
if (rateEstimator_->estRate_ < getBW()) {
return 0;
} else {
return 1 - getBW()/rateEstimator_->estRate_;
}
}
void PushbackQueueTimer::expire(Event *) {
// printf("PBQTimer: expiry at %g\n", Scheduler::instance().clock());
queue_->timeout(0);
}
|