File: dewp.cc

package info (click to toggle)
ns2 2.35%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 78,796 kB
  • sloc: cpp: 172,923; tcl: 107,130; perl: 6,391; sh: 6,143; ansic: 5,846; makefile: 816; awk: 525; csh: 355
file content (230 lines) | stat: -rw-r--r-- 6,806 bytes parent folder | download | duplicates (8)
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

/*
 * dewp.cc
 * Copyright (C) 1999 by the University of Southern California
 * $Id: dewp.cc,v 1.3 2010/03/08 05:54:49 tom_henderson Exp $
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License,
 * version 2, as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
 *
 *
 * The copyright of this module includes the following
 * linking-with-specific-other-licenses addition:
 *
 * In addition, as a special exception, the copyright holders of
 * this module give you permission to combine (via static or
 * dynamic linking) this module with free software programs or
 * libraries that are released under the GNU LGPL and with code
 * included in the standard release of ns-2 under the Apache 2.0
 * license or under otherwise-compatible licenses with advertising
 * requirements (or modified versions of such code, with unchanged
 * license).  You may copy and distribute such a system following the
 * terms of the GNU GPL for this module and the licenses of the
 * other code concerned, provided that you include the source code of
 * that other code when and as the GNU GPL requires distribution of
 * source code.
 *
 * Note that people who make modified versions of this module
 * are not obligated to grant this special exception for their
 * modified versions; it is their choice whether to do so.  The GNU
 * General Public License gives permission to release a modified
 * version without this exception; this exception also makes it
 * possible to release a modified version which carries forward this
 * exception.
 *
 */

//
// dewp.h (Early worm propagation detection)
//   by Xuan Chen (xuanc@isi.edu), USC/ISI

#include "ip.h"
#include "tcp.h"
#include "tcp-full.h"
#include "random.h"

#include "dewp.h"
BPEntry *DEWPPolicy::bport_list = NULL;
// Initialize parameters
double DEWPPolicy::dt_inv_ = DT_INV;
double DEWPPolicy::beta = 0.5;
double DEWPPolicy::alpha = 0.125;
// num per second
int DEWPPolicy::anum_th = 50;

// EW Policy: deal with queueing stuffs.
//Constructor.  
DEWPPolicy::DEWPPolicy() : Policy() {
  // Initialize detectors
  cdewp = NULL;

  bport_list = new BPEntry[P_LEN];
  for (int i = 0; i < P_LEN; i++) {
    dport_list[i] = 0;
    bport_list[i].s = bport_list[i].b = 0;
    bport_list[i].anum = bport_list[i].last_anum = bport_list[i].avg_anum = 0;
    bport_list[i].last_time = 0;
    bport_list[i].aset = NULL;
  }
}

//Deconstructor.
DEWPPolicy::~DEWPPolicy(){
  if (cdewp)
    free(cdewp);

  for (int i = 0; i < P_LEN; i++) {
    if (bport_list[i].aset) {
      AddrEntry * p = bport_list[i].aset;
      AddrEntry * q;
      while (p) {
        q = p->next;
        free(p);
        p = q;
      }
    }
  }
}

// Initialize the DEWP parameters
void DEWPPolicy::init(double dt_inv) {
  dt_inv_ = dt_inv;
  //printf("%f\n", dt_inv_);
}

// DEWP meter: do nothing.
//  measurement is done in policer: we need to know whether the packet is
//    dropped or not.
void DEWPPolicy::applyMeter(policyTableEntry *, Packet *pkt) {
  hdr_ip* iph = hdr_ip::access(pkt);

  dport_list[iph->dport()] = Scheduler::instance().clock();

  return;
}

// DEWP Policer
//  1. do measurement: P: both arrival and departure; B: only departure
//  2. make packet drop decisions
int DEWPPolicy::applyPolicer(policyTableEntry *, policerTableEntry *policer, Packet * pkt) {
  //printf("enter applyPolicer ");

  // can't count/penalize ACKs:
  //   with resp: may cause inaccurate calculation with TSW(??)
  //   with req:  may cause resp retransmission.
  // just pass them through
  hdr_ip* iph = hdr_ip::access(pkt);
  detect(pkt);
  if (bport_list[iph->dport()].b) {
    //printf("downgrade!\n");	
    return(policer->downgrade1);
  } else {
    //printf("initial!\n");	
    return(policer->initialCodePt);
  }
}

// detect if there is alarm triggered
void DEWPPolicy::detect(Packet *pkt) {
  // it is not for outbound traffic
  if (!cdewp)
    return;

  // get the current time
  now = Scheduler::instance().clock();

  // get IP header
  hdr_ip* iph = hdr_ip::access(pkt);
  int dport = iph->dport();
  unsigned int daddr = iph->daddr();

  // use dport matching to find suspects
  if (dport_list[dport] > 0 && (cdewp->dport_list[dport]) > 0 &&
      now - dport_list[dport]< dt_inv_ &&
      now - cdewp->dport_list[dport] < dt_inv_) {
	if (bport_list[dport].s == 0) {
      printf("S %.2f %d\n", now, dport);
      bport_list[dport].s = 1;
    }
  }

  // count outbound traffic only
  if (bport_list[dport].s == 1 && daddr > 0) {
    AddrEntry * p = bport_list[dport].aset; 
    
    while (p) {
      if (p->addr == daddr) {
        break;
      }
      p = p->next;
    }
    
    if (!p) {
      AddrEntry * new_addr = new AddrEntry;
      
      new_addr->addr = daddr;
      new_addr->next = NULL;
      
      if (bport_list[dport].aset) {
        new_addr->next = bport_list[dport].aset;
      };
      bport_list[dport].aset = new_addr;
    }
    bport_list[dport].anum++;
   
    /* debug purpose only
    p = bport_list[dport].aset;
    printf("[%d] ", dport);
    while (p) {
      printf("%u ", p->addr);
      p = p->next;
    }
    printf("\n");
    */

    if (now - bport_list[dport].last_time > dt_inv_) {
          //printf("DT %f %d %d %d\n", now, dport, bport_list[dport].anum, bport_list[dport].avg_anum);
      if (bport_list[dport].anum > anum_th * dt_inv_ &&
          bport_list[dport].avg_anum > 0 &&
          bport_list[dport].anum > (1 + beta) * bport_list[dport].avg_anum) {
        if (bport_list[dport].b == 0) {
          bport_list[dport].b = 1;
          printf("B %.2f %d %d %d\n", now, dport, bport_list[dport].anum, bport_list[dport].avg_anum);
        }
      }
      
      bport_list[dport].avg_anum = (int) (alpha * bport_list[dport].avg_anum + 
                                       (1 - alpha) * bport_list[dport].anum);
      if (bport_list[dport].avg_anum == 0 && bport_list[dport].anum > 0)
      	bport_list[dport].avg_anum = bport_list[dport].anum;
      bport_list[dport].last_anum = bport_list[dport].anum;
      bport_list[dport].anum = 0;
      bport_list[dport].last_time = now;
    }
    
  }
  
}

//  make packet drop decisions
int DEWPPolicy::dropPacket(Packet *) {
 
  return(0);
}

// couple DEWP detector
void DEWPPolicy::couple(DEWPPolicy *ewpc) {
  cdewp = ewpc;
}

// End of DEWP