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
|
#!/usr/bin/python
# -*- coding: utf8 -*-
import sys,json
supernodes= [ "kaah","supernode","euer","pa_sharepoint","oxberg" ]
""" TODO: Refactoring needed to pull the edges out of the node structures again,
it should be easier to handle both structures"""
DUMP_FILE = "/krebs/db/availability"
def write_digraph(nodes):
"""
writes the complete digraph in dot format
"""
print ('digraph retiolum {')
#print (' graph [center rankdir=LR packMode="clust"]')
print (' graph [center packMode="clust"]')
print (' node[shape=box,style=filled,fillcolor=grey]')
print (' overlap=false')
generate_stats(nodes)
merge_edges(nodes)
write_stat_node(nodes)
for k,v in nodes.iteritems():
write_node(k,v)
print ('}')
def dump_graph(nodes):
from time import time
graph = {}
graph['nodes'] = nodes
graph['timestamp'] = time()
f = open(DUMP_FILE,'a')
json.dump(graph,f)
f.write('\n')
f.close()
def write_stat_node(nodes):
''' Write a `stats` node in the corner
This node contains infos about the current number of active nodes and connections inside the network
'''
num_conns = 0
num_nodes = len(nodes)
for k,v in nodes.iteritems():
num_conns+= len(v['to'])
node_text = " stats_node [label=\"Statistics\\l"
node_text += "Active Nodes: %s\\l" % num_nodes
node_text += "Connections : %s\\l" % num_conns
node_text += "\""
node_text += ",fillcolor=green"
node_text += "]"
print(node_text)
def generate_stats(nodes):
""" Generates some statistics of the network and nodes
"""
f = open(DUMP_FILE,'r')
jlines = []
for line in f:
jlines.append(json.loads(line))
f.close()
for k,v in nodes.iteritems():
v['num_conns'] = len(v.get('to',[]))
v['availability'] = get_node_availability(k,jlines)
sys.stderr.write( "%s -> %f\n" %(k ,v['availability']))
def get_node_availability(name,jlines):
""" calculates the node availability by reading the generated dump file
adding together the uptime of the node and returning the time
parms:
name - node name
jlines - list of already parsed dictionaries node archive
"""
begin = last = current = 0
uptime = 0
#sys.stderr.write ( "Getting Node availability of %s\n" % name)
for stat in jlines:
ts = stat['timestamp']
if not begin:
begin = last = ts
current = ts
if stat['nodes'].get(name,{}).get('to',[]):
uptime += current - last
else:
pass
#sys.stderr.write("%s offline at timestamp %f\n" %(name,current))
last = ts
all_the_time = last - begin
return uptime/ all_the_time
def delete_unused_nodes(nodes):
new_nodes = {}
for k,v in nodes.iteritems():
if v['external-ip'] == "(null)":
continue
if v.get('to',[]):
new_nodes[k] = v
for k,v in new_nodes.iteritems():
if not [ i for i in v['to'] if i['name'] in new_nodes]:
#del(new_nodes[k])
del(k)
return new_nodes
def merge_edges(nodes):
""" merge back and forth edges into one
DESTRUCTS the current structure by deleting "connections" in the nodes
"""
for k,v in nodes.iteritems():
for con in v.get('to',[]):
for i,secon in enumerate(nodes.get(con['name'],{}).get('to',[])):
if k == secon['name']:
del (nodes[con['name']]['to'][i])
con['bidirectional'] = True
def write_node(k,v):
""" writes a single node and its edges
edges are weightet with the informations inside the nodes provided by
tinc
"""
node = " "+k+"[label=\""
node += k+"\\l"
node += "availability: %f\\l" % v['availability']
if v.has_key('num_conns'):
node += "Num Connects:"+str(v['num_conns'])+"\\l"
node += "external:"+v['external-ip']+":"+v['external-port']+"\\l"
for addr in v.get('internal-ip',['¯\\\\(°_o)/¯']):
node += "internal:"+addr+"\\l"
node +="\""
if k in supernodes:
node += ",fillcolor=steelblue1"
#node +=",group=\""+v['external-ip'].replace(".","")+"\""
node += "]"
print node
for con in v.get('to',[]):
label = con['weight']
w = int(con['weight'])
weight = str(1000 - (((w - 150) * (1000 - 0)) / (1000 -150 )) + 0)
length = str(float(w)/1500)
#weight = "1000" #str(300/float(con['weight']))
#weight = str((100/float(con['weight'])))
#weight = str(-1 * (200-100000/int(con['weight'])))
if float(weight) < 0 :
weight= "1"
#sys.stderr.write(weight + ":"+ length +" %s -> " %k + str(con) + "\n")
edge = " "+k+ " -> " +con['name'] + "[label="+label + " weight="+weight #+ " minlen="+length
if con.get('bidirectional',False):
edge += ",dir=both"
edge += "]"
print edge
def parse_input():
nodes={}
for line in sys.stdin:
line = line.replace('\n','')
if line == 'Nodes:':
nodes={}
for line in sys.stdin:
if line == 'End of nodes.\n':
break
l = line.replace('\n','').split() #TODO unhack me
nodes[l[0]]= { 'external-ip': l[2], 'external-port' : l[4] }
if line == 'Subnet list:':
for line in sys.stdin:
if line == 'End of subnet list.\n':
break
l = line.replace('\n','').split()
if not nodes[l[2]].get('internal-ip',False):
nodes[l[2]]['internal-ip'] = []
nodes[l[2]]['internal-ip'].append(l[0].split('#')[0])
if line == 'Edges:':
edges = {}
for line in sys.stdin:
if line == 'End of edges.\n':
break
l = line.replace('\n','').split()
if not nodes[l[0]].has_key('to') :
nodes[l[0]]['to'] = []
nodes[l[0]]['to'].append(
{'name':l[2],'addr':l[4],'port':l[6],'weight' : l[10] })
return nodes
nodes = parse_input()
nodes = delete_unused_nodes(nodes)
dump_graph(nodes)
write_digraph(nodes)
|
