-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.h
231 lines (203 loc) · 5.39 KB
/
node.h
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
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
/*
Each row in the table will have these fields
dstip: Destination IP address
nexthop: Next hop on the path to reach dstip
ip_interface: nexthop is reachable via this interface (a node can have multiple interfaces)
cost: cost of reaching dstip (number of hops)
*/
class RoutingEntry{
public:
string dstip, nexthop;
string ip_interface;
int cost;
/* You will have to add a new variable say, share_cost.
'share_cost' holds the cost that has to be shared with the neighbor.
This change will be required to complete Q.3. of the assignment. */
};
/*
* Class for specifying the sort order of Routing Table Entries
* while printing the routing tables
*
*/
class Comparator{
public:
bool operator()(const RoutingEntry &R1,const RoutingEntry &R2){
if (R1.cost == R2.cost) {
return R1.dstip.compare(R2.dstip)<0;
}
else if(R1.cost > R2.cost) {
return false;
}
else {
return true;
}
}
} ;
/*
This is the routing table
*/
struct routingtbl {
vector<RoutingEntry> tbl;
};
/*
Message format to be sent by a sender
from: Sender's ip
mytbl: Senders routing table
recvip: Receiver's ip
*/
class RouteMsg {
public:
string from; // I am sending this message, so it must be me i.e. if A is sending mesg to B then it is A's ip address
struct routingtbl *mytbl; // This is routing table of A
string recvip; // B ip address that will receive this message
};
/*
Emulation of network interface. Since we do not have a wire class,
we are showing the connection by the pair of IP's
ip: Own ip
connectedTo: An address to which above mentioned ip is connected via ethernet.
*/
class NetInterface {
private:
string ip;
string connectedTo; //this node is connected to this ip
public:
string getip() {
return this->ip;
}
string getConnectedIp() {
return this->connectedTo;
}
void setip(string ip) {
this->ip = ip;
}
void setConnectedip(string ip) {
this->connectedTo = ip;
}
};
/*
Struct of each node
name: It is just a label for a node
interfaces: List of network interfaces a node have
Node* is part of each interface, it easily allows to send message to another node
mytbl: Node's routing table
*/
class Node {
private:
string name;
vector<pair<NetInterface, Node*> > interfaces;
int cur_state;
protected:
struct routingtbl mytbl;
virtual void recvMsg(RouteMsg* msg) {
cout<<"Base"<<endl;
}
bool isMyInterface(string eth) {
for (int i = 0; i < interfaces.size(); ++i) {
if(interfaces[i].first.getip() == eth)
return true;
}
return false;
}
public:
bool operator<(const Node& node) const{
return (this->cur_state < node.cur_state);
}
void setName(string name){
this->name = name;
}
void setState(int state){
this->cur_state = state;
}
void addInterface(string ip, string connip, Node *nextHop) {
NetInterface eth;
eth.setip(ip);
eth.setConnectedip(connip);
interfaces.push_back({eth, nextHop});
}
void addTblEntry(string myip, int cost) {
RoutingEntry entry;
entry.dstip = myip;
entry.nexthop = myip;
entry.ip_interface = myip;
entry.cost = cost;
mytbl.tbl.push_back(entry);
}
void addTblEntry(string dstip, string nexthop, string ip_interface, int cost){
RoutingEntry entry;
entry.dstip = dstip;
entry.nexthop = nexthop;
entry.ip_interface = ip_interface;
entry.cost = cost;
mytbl.tbl.push_back(entry);
}
string getName() {
return this->name;
}
int getState(){
return this->cur_state;
}
vector<pair<NetInterface, Node*> > getInterfaces(){
return this->interfaces;
}
struct routingtbl getTable() {
return mytbl;
}
void printTable() {
Comparator myobject;
sort(mytbl.tbl.begin(),mytbl.tbl.end(),myobject);
cout<<this->getName()<<":"<<endl;
for (int i = 0; i < mytbl.tbl.size(); ++i) {
cout<<mytbl.tbl[i].dstip<<" | "<<mytbl.tbl[i].nexthop<<" | "<<mytbl.tbl[i].ip_interface<<" | "<<mytbl.tbl[i].cost <<endl;
}
}
void sendMsg(){
struct routingtbl ntbl;
for (int i = 0; i < mytbl.tbl.size(); ++i) {
ntbl.tbl.push_back(mytbl.tbl[i]);
}
for (int i = 0; i < interfaces.size(); ++i) {
RouteMsg msg;
msg.from = interfaces[i].first.getip();
msg.mytbl = &ntbl;
msg.recvip = interfaces[i].first.getConnectedIp();
// Dont send msg if poisened flag is set
int poisened = 0;
for(int i=0; i<msg.mytbl->tbl.size(); i++){ // Check for entry where nexthop is same as reciver node's interface
if(msg.recvip == msg.mytbl->tbl[i].nexthop){
poisened = 1;
break;
}
}
if(poisened){ // Skip sending this neighbour if poisened
continue;
}
interfaces[i].second->recvMsg(&msg);
}
}
void updateTbl(string node){
string other_interface;
for(int i=0; i<interfaces.size(); i++){
if(interfaces[i].second->getName()==node){
other_interface = interfaces[i].first.getConnectedIp();
break;
}
}
for(int i=0; i<mytbl.tbl.size(); i++){
if(mytbl.tbl[i].dstip == other_interface){
mytbl.tbl[i].cost = 16;
break;
}
}
}
};
class RoutingNode: public Node {
public:
void recvMsg(RouteMsg *msg);
};