Research Article
[Retracted] Vulnerability Digging for Software-Defined Network Controller Using Event Flow Graph Analysis
Algorithm 1
Static event flow graph constructing.
| Inputs: triple sequence S | | Outputs: static event flow graph G, event frequency table FreMat | (1) | G = {}, FreMat = {} | (2) | for node in sequence: | (3) | if node G: | (4) | FreMat[node]++ | (5) | if node G: | (6) | G.addnode(node), | (7) | FreMat.add(node) | (8) | if(node.EventHandler), | (9) | G.addedge(node.EventHandler, node.Event, node.Time) | (10) | if(node.EventProvider), | (11) | G.addedge(node. EventProvider, node.Event, node.Time) |
|