Pyvorin for Network Optimisation

Traffic Routing

Dijkstra and Bellman-Ford routing algorithms compiled for sub-millisecond path calculation.

def dijkstra(graph, source):
    dist = {v: float("inf") for v in graph}
    dist[source] = 0
    visited = set()
    while len(visited) < len(graph):
        u = min((v for v in graph if v not in visited), key=lambda x: dist[x])
        visited.add(u)
        for v, weight in graph[u].items():
            if dist[u] + weight < dist[v]:
                dist[v] = dist[u] + weight
    return dist

Load Balancing

Weighted round-robin and least-connection algorithms.

QoS Marking

Classify and mark packets based on compiled heuristics.