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
|
/*
* Copyright (c) 2000 Nortel Networks
* 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 Nortel Networks.
* 4. The name of the Nortel Networks may not be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY NORTEL 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 NORTEL 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.
*
* Developed by: Farhan Shallwani, Jeremy Ethridge
* Peter Pieda, and Mandeep Baines
* Maintainer: Peter Pieda <ppieda@nortelnetworks.com>
*/
/*
* Integrated into ns by Xuan Chen (xuanc@isi.edu)
* Add instance of policyClassifier.
*/
#include "dsEdge.h"
#include "ew.h"
#include "dewp.h"
#include "packet.h"
#include "tcp.h"
#include "random.h"
/*------------------------------------------------------------------------------
class edgeClass
------------------------------------------------------------------------------*/
static class edgeClass : public TclClass {
public:
edgeClass() : TclClass("Queue/dsRED/edge") {}
TclObject* create(int, const char*const*) {
return (new edgeQueue);
}
} class_edge;
/*------------------------------------------------------------------------------
edgeQueue() Constructor.
------------------------------------------------------------------------------*/
edgeQueue::edgeQueue() {
// policy = NULL;
}
/*------------------------------------------------------------------------------
void enque(Packet* pkt)
Post: The incoming packet pointed to by pkt is marked with an appropriate code
point (as handled by the marking method) and enqueued in the physical and
virtual queue corresponding to that code point (as specified in the PHB
Table).
Uses: Methods Policy::mark(), lookupPHBTable(), and redQueue::enque().
------------------------------------------------------------------------------*/
void edgeQueue::enque(Packet* pkt) {
// Mark the packet with the specified priority:
//printf("before ,mark\n");
policy.mark(pkt);
// printf("after ,mark\n");
dsREDQueue::enque(pkt);
}
/*------------------------------------------------------------------------------
int command(int argc, const char*const* argv)
Commands from the ns file are interpreted through this interface.
------------------------------------------------------------------------------*/
int edgeQueue::command(int argc, const char*const* argv) {
if (strcmp(argv[1], "addPolicyEntry") == 0) {
// Note: the definition of policy has changed.
policy.addPolicyEntry(argc, argv);
return(TCL_OK);
};
if (strcmp(argv[1], "addPolicerEntry") == 0) {
// Note: the definition of policy has changed.
policy.addPolicerEntry(argc, argv);
return(TCL_OK);
};
if (strcmp(argv[1], "couple") == 0) {
/*
printf("%d ", argc);
for (int i = 1; i < argc; i++)
printf("%d(%s) ", i, argv[i]);
printf("\n");
*/
DEWPPolicy *ewp = (DEWPPolicy *)(policy.policy_pool[DEWP]);
// Get the pointer to the queue to be coupled (in c++)
//Tcl& tcl = Tcl::instance();
edgeQueue *cq = (edgeQueue*) TclObject::lookup(argv[2]);
DEWPPolicy *ewpc = (DEWPPolicy *)((cq->policy).policy_pool[DEWP]);
ewp->couple(ewpc);
return(TCL_OK);
};
// couple the EW on request and response links
if (strcmp(argv[1], "coupleEW") == 0) {
//printf("%d ", argc);
//for (int i = 1; i < argc; i++)
//printf("%d(%s) ", i, argv[i]);
//printf("\n");
EWPolicy *ewp = (EWPolicy *)(policy.policy_pool[EW]);
// Get the pointer to the queue to be coupled (in c++)
//Tcl& tcl = Tcl::instance();
edgeQueue *cq = (edgeQueue*) TclObject::lookup(argv[2]);
EWPolicy *ewpc = (EWPolicy *)((cq->policy).policy_pool[EW]);
// couple the EW detector
if (argc > 3)
ewp->coupleEW(ewpc, atof(argv[3]));
else
ewp->coupleEW(ewpc);
return(TCL_OK);
};
// Set a rate limitor
if (strcmp(argv[1], "limit") == 0) {
//printf("%d ", argc);
//for (int i = 1; i < argc; i++)
// printf("%d(%s) ", i, argv[i]);
//printf("\n");
EWPolicy *ewp = (EWPolicy *)(policy.policy_pool[EW]);
// Packet rate limitor
if (strcmp(argv[2], "P") == 0) {
ewp->limitPr(atoi(argv[3]));
return(TCL_OK);
}
// bits rate limitor
if (strcmp(argv[2], "B") == 0) {
ewp->limitBr(atoi(argv[3]));
return(TCL_OK);
}
};
// Setup an EW detector on a link
if (strcmp(argv[1], "detect") == 0) {
//printf("%d ", argc);
//for (int i = 1; i < argc; i++)
// printf("%d(%s) ", i, argv[i]);
//printf("\n");
EWPolicy *ewp = (EWPolicy *)(policy.policy_pool[EW]);
if (strcmp(argv[2], "P") == 0) {
if (argc > 4)
ewp->detectPr(atoi(argv[3]), atoi(argv[4]));
else if (argc > 3)
ewp->detectPr(atoi(argv[3]));
else
ewp->detectPr();
return(TCL_OK);
}
if (strcmp(argv[2], "B") == 0) {
if (argc > 4)
ewp->detectBr(atoi(argv[3]), atoi(argv[4]));
else if (argc > 3)
ewp->detectBr(atoi(argv[3]));
else
ewp->detectBr();
return(TCL_OK);
}
};
if (strcmp(argv[1], "getCBucket") == 0) {
Tcl& tcl = Tcl::instance();
tcl.resultf("%f", policy.getCBucket(argv));
return(TCL_OK);
}
if (strcmp(argv[1], "printPolicyTable") == 0) {
policy.printPolicyTable();
return(TCL_OK);
}
if (strcmp(argv[1], "printPolicerTable") == 0) {
policy.printPolicerTable();
return(TCL_OK);
}
return(dsREDQueue::command(argc, argv));
}
|
