-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNode.ned
More file actions
61 lines (54 loc) · 1.82 KB
/
Copy pathNode.ned
File metadata and controls
61 lines (54 loc) · 1.82 KB
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
// SDN Control Traffic Simulator: simulate control traffic throughput
// and latencies in a variety of topologies
// Copyright (C) 2020 Ananya Gopal, Jesse Chen
// This program is free software: you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
// 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, see <https://www.gnu.org/licenses/>.
//
// A "Node" consists of a Routing plus an App module which represents the
// aggregate traffic of the subnets connected to that router.
//
module Node
{
parameters:
int address;
string appType;
int num_flows;
@display("i=misc/node_vs,gold");
gates:
inout port[];
submodules:
app: <appType> like IApp {
parameters:
address = address;
@display("p=140,60");
}
routing: Routing {
parameters:
@display("p=140,130");
gates:
in[sizeof(port)];
out[sizeof(port)];
}
q[sizeof(port)]: Qu {
parameters:
@display("p=80,200,row");
address_qu = address;
}
connections:
routing.localOut --> app.in;
routing.localIn <-- app.out;
for i=0..sizeof(port)-1 {
routing.out[i] --> q[i].in;
routing.in[i] <-- q[i].out;
q[i].line <--> port[i];
}
}