-
Notifications
You must be signed in to change notification settings - Fork 46
/
Controller.py
413 lines (359 loc) · 16.8 KB
/
Controller.py
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
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
# Copyright (C) 2011 Nippon Telegraph and Telephone Corporation.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
# implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from ryu.base import app_manager
from ryu.controller import ofp_event
from ryu.controller.handler import CONFIG_DISPATCHER, MAIN_DISPATCHER, DEAD_DISPATCHER
from ryu.controller.handler import set_ev_cls
from ryu.ofproto import ofproto_v1_3
from ryu.lib.packet import packet
from ryu.lib.packet import ethernet
from ryu.topology import event
from ryu.topology.api import get_all_switch, get_all_link, get_switch, get_link
from ryu.lib import dpid as dpid_lib
from ryu.controller import dpset
import copy
from threading import Lock
UP = 1
DOWN = 0
class SimpleSwitch13(app_manager.RyuApp):
OFP_VERSIONS = [ofproto_v1_3.OFP_VERSION]
def __init__(self, *args, **kwargs):
super(SimpleSwitch13, self).__init__(*args, **kwargs)
# USed for learning switch functioning
self.mac_to_port = {}
# Holds the topology data and structure
self.topo_shape = TopoStructure()
# The state transition: HANDSHAKE -> CONFIG -> MAIN
#
# HANDSHAKE: if it receives HELLO message with the valid OFP version,
# sends Features Request message, and moves to CONFIG.
#
# CONFIG: it receives Features Reply message and moves to MAIN
#
# MAIN: it does nothing. Applications are expected to register their
# own handlers.
@set_ev_cls(ofp_event.EventOFPSwitchFeatures, CONFIG_DISPATCHER)
def switch_features_handler(self, ev):
msg = ev.msg
self.logger.info('OFPSwitchFeatures received: '
'\n\tdatapath_id=0x%016x n_buffers=%d '
'\n\tn_tables=%d auxiliary_id=%d '
'\n\tcapabilities=0x%08x',
msg.datapath_id, msg.n_buffers, msg.n_tables,
msg.auxiliary_id, msg.capabilities)
datapath = ev.msg.datapath
ofproto = datapath.ofproto
parser = datapath.ofproto_parser
match = parser.OFPMatch()
actions = [parser.OFPActionOutput(ofproto.OFPP_CONTROLLER,
ofproto.OFPCML_NO_BUFFER)]
self.add_flow(datapath, 0, match, actions)
def delete_flow(self, datapath):
ofproto = datapath.ofproto
parser = datapath.ofproto_parser
for dst in self.mac_to_port[datapath.id].keys():
match = parser.OFPMatch(eth_dst=dst)
mod = parser.OFPFlowMod(
datapath, command=ofproto.OFPFC_DELETE,
out_port=ofproto.OFPP_ANY, out_group=ofproto.OFPG_ANY,
priority=1, match=match)
datapath.send_msg(mod)
def add_flow(self, datapath, priority, match, actions, buffer_id=None):
ofproto = datapath.ofproto
parser = datapath.ofproto_parser
inst = [parser.OFPInstructionActions(ofproto.OFPIT_APPLY_ACTIONS,
actions)]
if buffer_id:
mod = parser.OFPFlowMod(datapath=datapath, buffer_id=buffer_id,
priority=priority, match=match,
instructions=inst)
else:
mod = parser.OFPFlowMod(datapath=datapath, priority=priority,
match=match, instructions=inst)
datapath.send_msg(mod)
"""
This is called when Ryu receives an OpenFlow packet_in message. The trick is set_ev_cls decorator. This decorator
tells Ryu when the decorated function should be called.
"""
@set_ev_cls(ofp_event.EventOFPPacketIn, MAIN_DISPATCHER)
def _packet_in_handler(self, ev):
if ev.msg.msg_len < ev.msg.total_len:
self.logger.debug("packet truncated: only %s of %s bytes",
ev.msg.msg_len, ev.msg.total_len)
msg = ev.msg
datapath = msg.datapath
ofproto = datapath.ofproto
parser = datapath.ofproto_parser
in_port = msg.match['in_port']
pkt = packet.Packet(msg.data)
eth = pkt.get_protocols(ethernet.ethernet)[0]
dst = eth.dst
src = eth.src
dpid = datapath.id
self.mac_to_port.setdefault(dpid, {})
# self.logger.info("\tpacket in %s %s %s %s", dpid, src, dst, in_port)
# learn a mac address to avoid FLOOD next time.
self.mac_to_port[dpid][src] = in_port
if dst in self.mac_to_port[dpid]:
out_port = self.mac_to_port[dpid][dst]
else:
out_port = ofproto.OFPP_FLOOD
actions = [parser.OFPActionOutput(out_port)]
# install a flow to avoid packet_in next time
if out_port != ofproto.OFPP_FLOOD:
match = parser.OFPMatch(in_port=in_port, eth_dst=dst)
# verify if we have a valid buffer_id, if yes avoid to send both
# flow_mod & packet_out
if msg.buffer_id != ofproto.OFP_NO_BUFFER:
self.add_flow(datapath, 1, match, actions, msg.buffer_id)
return
else:
self.add_flow(datapath, 1, match, actions)
data = None
if msg.buffer_id == ofproto.OFP_NO_BUFFER:
data = msg.data
out = parser.OFPPacketOut(datapath=datapath, buffer_id=msg.buffer_id,
in_port=in_port, actions=actions, data=data)
datapath.send_msg(out)
###################################################################################
"""
The event EventSwitchEnter will trigger the activation of get_topology_data().
"""
@set_ev_cls(event.EventSwitchEnter)
def handler_switch_enter(self, ev):
self.topo_shape.topo_raw_switches = copy.copy(get_switch(self, None))
self.topo_shape.topo_raw_links = copy.copy(get_link(self, None))
self.topo_shape.print_links("EventSwitchEnter")
self.topo_shape.print_switches("EventSwitchEnter")
@set_ev_cls(event.EventSwitchLeave, [MAIN_DISPATCHER, CONFIG_DISPATCHER, DEAD_DISPATCHER])
def handler_switch_leave(self, ev):
self.logger.info("Not tracking Switches, switch leaved.")
"""
This function determines the links and switches currently in the topology
"""
def get_topology_data(self):
# Call get_switch() to get the list of objects Switch.
self.topo_shape.topo_raw_switches = copy.copy(get_all_switch(self))
# Call get_link() to get the list of objects Link.
self.topo_shape.topo_raw_links = copy.copy(get_all_link(self))
self.topo_shape.print_links("get_topology_data")
self.topo_shape.print_switches("get_topology_data")
###################################################################################
"""
EventOFPPortStatus: An event class for switch port status notification.
The bellow handles the event.
"""
@set_ev_cls(dpset.EventPortModify, MAIN_DISPATCHER)
def port_modify_handler(self, ev):
self.topo_shape.lock.acquire()
dp = ev.dp
port_attr = ev.port
dp_str = dpid_lib.dpid_to_str(dp.id)
self.logger.info("\t ***switch dpid=%s"
"\n \t port_no=%d hw_addr=%s name=%s config=0x%08x "
"\n \t state=0x%08x curr=0x%08x advertised=0x%08x "
"\n \t supported=0x%08x peer=0x%08x curr_speed=%d max_speed=%d" %
(dp_str, port_attr.port_no, port_attr.hw_addr,
port_attr.name, port_attr.config,
port_attr.state, port_attr.curr, port_attr.advertised,
port_attr.supported, port_attr.peer, port_attr.curr_speed,
port_attr.max_speed))
if port_attr.state == 1:
tmp_list = []
removed_link = self.topo_shape.link_with_src_port(port_attr.port_no, dp.id)
for i, link in enumerate(self.topo_shape.topo_raw_links):
if link.src.dpid == dp.id and link.src.port_no == port_attr.port_no:
print "\t Removing link " + str(link) + " with index " + str(i)
# del self.topo_shape.topo_raw_links[i]
elif link.dst.dpid == dp.id and link.dst.port_no == port_attr.port_no:
print "\t Removing link " + str(link) + " with index " + str(i)
# del self.topo_shape.topo_raw_links[i]
else:
tmp_list.append(link)
self.topo_shape.topo_raw_links = copy.copy(tmp_list)
self.topo_shape.print_links("Link Down")
print "\t Considering the removed Link " + str(removed_link)
if removed_link is not None:
shortest_path_hubs, shortest_path_node = self.topo_shape.find_shortest_path(removed_link.src.dpid)
print("\t\tNew shortest_path_hubs: {0}\n\t\tNew shortest_path_node: {1}".format(shortest_path_hubs, shortest_path_node))
elif port_attr.state == 0:
self.topo_shape.print_links("Link Up")
self.topo_shape.lock.release()
###################################################################################
###################################################################################
"""
This class holds the list of links and switches in the topology and it provides some useful functions
"""
class TopoStructure():
def __init__(self, *args, **kwargs):
self.topo_raw_switches = []
self.topo_raw_links = []
self.topo_links = []
self.lock = Lock()
def print_links(self, func_str=None):
# Convert the raw link to list so that it is printed easily
print(" \t" + str(func_str) + ": Current Links:")
for l in self.topo_raw_links:
print (" \t\t" + str(l))
def print_switches(self, func_str=None):
print(" \t" + str(func_str) + ": Current Switches:")
for s in self.topo_raw_switches:
print (" \t\t" + str(s))
def switches_count(self):
return len(self.topo_raw_switches)
def convert_raw_links_to_list(self):
# Build a list with all the links [((srcNode,port), (dstNode, port))].
# The list is easier for printing.
self.topo_links = [((link.src.dpid, link.src.port_no),
(link.dst.dpid, link.dst.port_no))
for link in self.topo_raw_links]
def convert_raw_switch_to_list(self):
# Build a list with all the switches ([switches])
self.topo_switches = [(switch.dp.id, UP) for switch in self.topo_raw_switches]
"""
Adds the link to list of raw links
"""
def bring_up_link(self, link):
self.topo_raw_links.append(link)
"""
Check if a link with specific nodes exists.
"""
def check_link(self, sdpid, sport, ddpid, dport):
for i, link in self.topo_raw_links:
if ((sdpid, sport), (ddpid, dport)) == (
(link.src.dpid, link.src.port_no), (link.dst.dpid, link.dst.port_no)):
return True
return False
"""
Finds the shortest path from source s to all other nodes.
Both s and d are switches.
"""
def find_shortest_path(self, s):
# I really recommend watching this video: https://www.youtube.com/watch?v=zXfDYaahsNA
s_count = self.switches_count()
s_temp = s
# If you wanna see the prinfs set this to one.
verbose = 0
visited = []
Fereng = []
Fereng.append(s_temp)
# Records number of hubs which you can reach the node from specified src
shortest_path_hubs = {}
# The last node which you can access the node from. For example: {1,2} means you can reach node 1 from node 2.
shortest_path_node = {}
shortest_path_hubs[s_temp] = 0
shortest_path_node[s_temp] = s_temp
while s_count > len(visited):
if verbose == 1: print "visited in: " + str(visited)
visited.append(s_temp)
if verbose == 1: print ("Fereng in: " + str(Fereng))
if verbose == 1: print ("s_temp in: " + str(s_temp))
for l in self.find_links_with_src(s_temp):
if verbose == 1: print "\t" + str(l)
if l.dst.dpid not in visited:
Fereng.append(l.dst.dpid)
if verbose == 1: print ("\tAdded {0} to Fereng: ".format(l.dst.dpid))
if l.dst.dpid in shortest_path_hubs:
# Find the minimum o
if shortest_path_hubs[l.src.dpid] + 1 < shortest_path_hubs[l.dst.dpid]:
shortest_path_hubs[l.dst.dpid] = shortest_path_hubs[l.src.dpid] + 1
shortest_path_node[l.dst.dpid] = l.src.dpid
else:
shortest_path_hubs[l.dst.dpid] = shortest_path_hubs[l.dst.dpid]
if verbose == 1: print(
"\t\tdst dpid found in shortest_path. Count: " + str(shortest_path_hubs[l.dst.dpid]))
elif l.src.dpid in shortest_path_hubs and l.dst.dpid not in shortest_path_hubs:
if verbose == 1: print("\t\tdst dpid not found bit src dpid found.")
shortest_path_hubs[l.dst.dpid] = shortest_path_hubs[l.src.dpid] + 1
shortest_path_node[l.dst.dpid] = l.src.dpid
if verbose == 1:
print ("shortest_path Hubs: " + str(shortest_path_hubs))
print ("shortest_path Node: " + str(shortest_path_node))
if s_temp in Fereng:
Fereng.remove(s_temp)
#min_val = min(Fereng)
if verbose == 1: print ("Fereng out: " + str(Fereng))
t_dpid = [k for k in Fereng if k not in visited]
if verbose == 1: print ("Next possible dpids (t_dpid): " + str(t_dpid))
if len(t_dpid) != 0:
s_temp = t_dpid[t_dpid.index(min(t_dpid))]
if verbose == 1: print "s_temp out: " + str(s_temp)
if verbose == 1: print "visited out: " + str(visited) + "\n"
return shortest_path_hubs, shortest_path_node
"""
Find a path between src and dst based on the shorted path info which is stored on shortest_path_node
"""
def find_path_from_topo(self,src_dpid, dst_dpid, shortest_path_node):
path = []
now_node = dst_dpid
last_node = None
while now_node != src_dpid:
last_node = shortest_path_node.pop(now_node, None)
if last_node != None:
l = self.link_from_src_to_dst(now_node, last_node)
if l is None:
print("Link between {0} and {1} was not found in topo.".format(now_node, last_node))
else:
path.append(l)
now_node = last_node
else:
print "Path could not be found"
return path
"""
Finds the dpids of destinations where the links' source is s_dpid
"""
def find_dst_with_src(self, s_dpid):
d = []
for l in self.topo_raw_links:
if l.src.dpid == s_dpid:
d.append(l.dst.dpid)
return d
"""
Finds the list of link objects where links' src dpid is s_dpid
"""
def find_links_with_src(self, s_dpid):
d_links = []
for l in self.topo_raw_links:
if l.src.dpid == s_dpid:
d_links.append(l)
return d_links
"""
Returns a link object that has in_dpid and in_port as either source or destination dpid and port.
"""
def link_with_src_dst_port(self, in_port, in_dpid):
for l in self.topo_raw_links:
if (l.src.dpid == in_dpid and l.src.port_no == in_port) or (
l.dst.dpid == in_dpid and l.src.port_no == in_port):
return l
return None
"""
Returns a link object from src with dpid s to dest with dpid d.
"""
def link_from_src_to_dst(self, s, d):
for l in self.topo_raw_links:
if l.src.dpid == s and l.dst.dpid == d:
return l
return None
"""
Returns a link object that has in_dpid and in_port as either source dpid and port.
"""
def link_with_src_port(self, in_port, in_dpid):
for l in self.topo_raw_links:
if (l.src.dpid == in_dpid and l.src.port_no == in_port) or (l.dst.dpid == in_dpid and l.src.port_no == in_port):
return l
return None
########## Functions related to Spanning Tree Algorithm ##########
def find_root_switch(self):
pass