Network_attack_propagation/network_attack_propagation.py

250 lines
7.1 KiB
Python
Raw Normal View History

2022-06-16 19:57:51 +02:00
import random
2022-06-16 21:44:51 +02:00
from statistics import mean
2022-06-16 19:57:51 +02:00
import matplotlib.pyplot as plt
2022-06-16 21:44:51 +02:00
import networkx as nx
2022-06-16 19:57:51 +02:00
from matplotlib import animation
2022-06-16 18:39:16 +02:00
class Node:
2022-06-16 19:57:51 +02:00
def __init__(self, is_infected=False):
self.id = random.randint(1, 2000000)
self.is_infected = is_infected
self.under_attack = False
2022-06-16 19:57:51 +02:00
def as_tuple(self):
return self.id, self.is_infected
def __repr__(self):
2022-06-16 21:05:08 +02:00
return f'id: {self.id}, infected: {self.is_infected}'
2022-06-16 18:39:16 +02:00
class Edge:
def __init__(self, node_a: Node, node_b: Node, weight: float):
self.node_a = node_a
self.node_b = node_b
self.weight = weight
2022-06-16 19:57:51 +02:00
def as_tuple(self):
2022-06-16 21:05:08 +02:00
return self.node_a, self.node_b, {'weight': self.weight}
2022-06-16 19:57:51 +02:00
2022-06-16 22:05:00 +02:00
def has_node(self, node: Node) -> bool:
return self.node_a is node or self.node_b is node
2022-06-16 18:39:16 +02:00
class Graph:
2022-06-16 22:05:00 +02:00
def __init__(self, use_weights=False):
2022-06-16 18:39:16 +02:00
self.edges = []
2022-06-16 22:05:00 +02:00
self.use_weights = use_weights
2022-06-16 22:30:53 +02:00
self.rounds_survived = 0
2022-06-16 18:39:16 +02:00
def add_edge(self, edge: Edge):
2022-06-16 19:57:51 +02:00
self.edges.append(edge)
def add_edges(self, edges: [Edge]):
[self.edges.append(e) for e in edges]
2022-06-16 20:14:56 +02:00
def get_nodes(self) -> [Node]:
nodes = set()
for edge in self.edges:
nodes.add(edge.node_a)
nodes.add(edge.node_b)
return nodes
2022-06-16 19:57:51 +02:00
def clear_attacked(self) -> None:
for edge in self.edges:
edge.node_a.under_attack = False
edge.node_b.under_attack = False
2022-06-16 22:05:00 +02:00
def get_adjacent_nodes(self, node: Node) -> [(Node, int)]:
"""
:param node: Node to search for
:return: An array of tuples (node, weight)
"""
edges_with_node = filter(lambda ed: ed.has_node(node), self.edges)
nodes = set()
for e in edges_with_node:
if e.node_a is node:
nodes.add((e.node_b, e.weight))
else:
nodes.add((e.node_a, e.weight))
return nodes
2022-06-16 22:30:53 +02:00
def is_alive(self):
nodes_alive = list(filter(lambda x: not x.is_infected, self.get_nodes()))
return len(nodes_alive) > 0
def update_survived(self):
if not self.is_alive():
return
self.rounds_survived += 1
2022-06-16 22:05:00 +02:00
def infect_step(self):
infected_nodes = list(filter(lambda n: n.is_infected, self.get_nodes()))
for node in infected_nodes:
adjacent_nodes = self.get_adjacent_nodes(node)
if self.use_weights:
to_be_infected = random.choices([n[0] for n in adjacent_nodes], weights=[n[1] for n in adjacent_nodes])[0]
else:
to_be_infected = random.choice([n[0] for n in adjacent_nodes])
to_be_infected.is_infected = True
to_be_infected.under_attack = True
2022-06-16 22:30:53 +02:00
self.update_survived()
2022-06-16 22:05:00 +02:00
2022-06-16 20:14:56 +02:00
def update(num, layout, g_repr, ax, our_graph: Graph):
2022-06-16 19:57:51 +02:00
"""
This function is called every 'step', so if you wish to update the graph, do it here
"""
2022-06-16 22:30:53 +02:00
if not our_graph.is_alive():
return
if num != 0:
our_graph.infect_step()
2022-06-16 19:57:51 +02:00
ax.clear()
2022-06-16 20:14:56 +02:00
ax.set_title(f'Step: {num}', loc='right', fontsize=30)
2022-06-16 21:05:08 +02:00
colors = ['red' if n.is_infected else 'blue' for n in g_repr]
edgecolors = ['black' if n.under_attack else 'none' for n in g_repr]
linewidths = [3 if c == 'black' else 0 for c in edgecolors]
sizes = [300 if n.is_infected else 150 for n in g_repr]
2022-06-16 21:05:08 +02:00
nx.draw(
g_repr,
ax=ax,
pos=layout,
node_color=colors,
linewidths=linewidths,
edgecolors=edgecolors,
2022-06-16 21:05:08 +02:00
with_labels=False,
node_size=sizes,
2022-06-16 22:30:53 +02:00
alpha=0.7,
2022-06-16 21:05:08 +02:00
)
2022-06-16 19:57:51 +02:00
our_graph.clear_attacked()
2022-06-16 19:57:51 +02:00
2022-06-16 21:17:45 +02:00
def do_graph_animation(output_file_name: str, in_graph: Graph, frame_count: int, layout):
2022-06-16 19:57:51 +02:00
g_repr = nx.Graph()
# Convert our graph class into tuples understood by networkx
g_repr.add_edges_from([e.as_tuple() for e in in_graph.edges])
2022-06-16 21:17:45 +02:00
layout = layout(g_repr)
2022-06-16 19:57:51 +02:00
fig, ax = plt.subplots()
2022-06-16 22:30:53 +02:00
fig.set_figwidth(8)
fig.set_figheight(8)
2022-06-16 21:05:08 +02:00
2022-06-16 20:58:13 +02:00
anim = animation.FuncAnimation(
2022-06-16 22:05:00 +02:00
fig, update, frames=frame_count, interval=500, fargs=(layout, g_repr, ax, in_graph)
2022-06-16 20:58:13 +02:00
)
2022-06-16 19:57:51 +02:00
anim.save(output_file_name)
2022-06-16 21:05:08 +02:00
plt.style.use('seaborn')
2022-06-16 19:57:51 +02:00
plt.show()
2022-06-20 21:18:05 +02:00
def degree_avg(edges, digits=2):
degrees = {}
2022-06-16 21:44:51 +02:00
for e in edges:
2022-06-20 21:18:05 +02:00
degrees[e.node_a] = degrees.get(e.node_a, 0) + 1
degrees[e.node_b] = degrees.get(e.node_b, 0) + 1
return round(mean(degrees.values()), digits)
2022-06-16 21:44:51 +02:00
2022-06-21 16:24:48 +02:00
def bus_network(n=30, infected_idx=0) -> tuple[Graph, float, int]:
network = Graph()
nodes = [Node() for _ in range(n)]
nodes[infected_idx].is_infected = True
edges = [Edge(nodes[i], nodes[i + 1], 1.0) for i in range(n - 1)]
network.add_edges(edges)
2022-06-21 15:45:29 +02:00
return network, degree_avg(edges), n
2022-06-20 21:18:05 +02:00
def star_network(cluster_count=5, starsize=6) -> tuple[Graph, float, int]:
2022-06-16 21:44:51 +02:00
node_count = cluster_count + cluster_count * starsize + 1
nodes = [Node() for _ in range(node_count)]
2022-06-20 21:18:05 +02:00
nodes[starsize-1].is_infected = True
2022-06-16 21:44:51 +02:00
edges = []
for x in range(cluster_count):
center_node = x * starsize + x
edges += [Edge(nodes[center_node], nodes[i], 1.0) for i in range(center_node + 1, center_node + starsize + 1)]
edges.append(Edge(nodes[-1], nodes[center_node], 1.0))
network = Graph()
network.add_edges(edges)
2022-06-20 21:18:05 +02:00
return network, degree_avg(edges), node_count
2022-06-16 21:44:51 +02:00
2022-06-21 16:24:48 +02:00
def ring_network(n=30) -> tuple[Graph, float, int]:
2022-06-16 20:58:13 +02:00
network = Graph()
nodes = [Node() for _ in range(n)]
2022-06-16 22:05:00 +02:00
nodes[0].is_infected = True
2022-06-16 20:58:13 +02:00
edges = [Edge(nodes[i], nodes[i + 1], 1.0) for i in range(n - 1)]
end_edge = Edge(nodes[n - 1], nodes[0], 1.0)
edges.append(end_edge)
2022-06-16 20:44:58 +02:00
network.add_edges(edges)
2022-06-21 15:45:29 +02:00
return network, degree_avg(edges), n
2022-06-20 21:18:05 +02:00
def summary(average_degrees: list[float], propagation_speeds: list[float]) -> None:
fig, ax = plt.subplots()
ax.plot(average_degrees, propagation_speeds)
ax.set(xlabel='Average degree', ylabel='Propagation speed', title='Summary')
fig.savefig("summary.png")
plt.show()
2022-06-21 16:24:48 +02:00
2022-06-21 16:28:11 +02:00
def experiment(network, avg_degree, node_count, iteration):
2022-06-21 15:45:29 +02:00
degrees = []
speeds = []
2022-06-21 16:28:11 +02:00
do_graph_animation(f'bus{iteration}.gif', network, 90, nx.spiral_layout)
2022-06-21 16:37:09 +02:00
speeds.append(node_count / network.rounds_survived)
2022-06-21 16:28:11 +02:00
degrees.append(avg_degree)
print(f"\n{node_count} NODE BUS")
print(f"average degree = {avg_degree}")
print(f"propagation speed = {round(speeds[-1], 2)}")
print(f"bus_{iteration} rounds survived = {network.rounds_survived + 1}")
2022-06-21 15:45:29 +02:00
summary(degrees, speeds)
2022-06-21 16:24:48 +02:00
def bus_experiment():
2022-06-21 16:28:11 +02:00
sizes = [0, 8, 15]
for i in sizes:
bus, bus_avg_degree, node_count = bus_network(20 + i)
experiment(bus, bus_avg_degree, node_count, i)
2022-06-21 16:24:48 +02:00
2022-06-21 15:45:29 +02:00
def ring_experiment():
2022-06-21 16:28:11 +02:00
sizes = [0, 8, 15]
for i in sizes:
ring, ring_avg_degree, node_count = ring_network(20 + i)
experiment(ring, ring_avg_degree, node_count, i)
2022-06-21 16:24:48 +02:00
2022-06-20 21:18:05 +02:00
def star_experiment():
2022-06-21 16:28:11 +02:00
sizes = [0, 8, 15]
for i in sizes:
star, star_avg_degree, node_count = star_network(cluster_count=3 + i, starsize=3 + i)
experiment(star, star_avg_degree, node_count, i)
def weighted_star_experiment():
2022-06-20 21:18:05 +02:00
2022-06-16 20:44:58 +02:00
2022-06-16 19:57:51 +02:00
def main():
2022-06-21 15:45:29 +02:00
bus_experiment()
ring_experiment()
2022-06-20 21:18:05 +02:00
star_experiment()
2022-06-16 19:57:51 +02:00
if __name__ == "__main__":
main()