diff options
author | makefu <github@syntax-fehler.de> | 2011-11-03 20:14:51 +0100 |
---|---|---|
committer | makefu <github@syntax-fehler.de> | 2011-11-03 20:14:51 +0100 |
commit | c5215ab05d807bb017a09e44c43cf233f7d3ea9a (patch) | |
tree | db33ea6b5bb41e9daa2f2bf0b877edb442b192bc /retiolum/scripts/adv_graphgen/parse.py | |
parent | 822c43a763aa61c1accce3768090d066048faaff (diff) | |
parent | 88690a1722dff0a2ef06bee6e1fcdfcfc1041c08 (diff) |
Merge branch 'master' of github.com:krebscode/painload
Diffstat (limited to 'retiolum/scripts/adv_graphgen/parse.py')
-rwxr-xr-x | retiolum/scripts/adv_graphgen/parse.py | 101 |
1 files changed, 92 insertions, 9 deletions
diff --git a/retiolum/scripts/adv_graphgen/parse.py b/retiolum/scripts/adv_graphgen/parse.py index aae69f0f..e99a5573 100755 --- a/retiolum/scripts/adv_graphgen/parse.py +++ b/retiolum/scripts/adv_graphgen/parse.py @@ -1,28 +1,96 @@ #!/usr/bin/python # -*- coding: utf8 -*- -import sys +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) - nodes = delete_unused_nodes(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',[])) + conns = v.get('to',[]) + v['num_conns'] = len(conns) + v['avg_weight'] = get_node_avg_weight(conns) + v['availability'] = get_node_availability(k,jlines) + sys.stderr.write( "%s -> %f\n" %(k ,v['availability'])) +def get_node_avg_weight(conns): + """ calculates the average weight for the given connections """ + if not conns: + sys.syderr.write("get_node_avg_weight: connection parameter empty") + return 9001 + else: + return sum([float(c['weight']) for c in conns])/len(conns) +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(): @@ -38,7 +106,6 @@ def delete_unused_nodes(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',[]): @@ -56,20 +123,34 @@ def write_node(k,v): node = " "+k+"[label=\"" node += k+"\\l" - node += "external:"+v['external-ip']+":"+v['external-port']+"\\l" + node += "availability: %f\\l" % v['availability'] + node += "avg weight: %.2f\\l" % v['avg_weight'] 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 v['external-ip'] == "MYSELF": + if k in supernodes: node += ",fillcolor=steelblue1" - node +=",group=\""+v['external-ip'].replace(".","")+"\"" + #node +=",group=\""+v['external-ip'].replace(".","")+"\"" node += "]" print node for con in v.get('to',[]): - edge = " "+k+ " -> " +con['name'] + "[weight="+str(float(con['weight'])) + 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 += "]" @@ -107,4 +188,6 @@ def parse_input(): {'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) |