

What is the project about?
Communication networks have become a critical infrastructure of our digital society. This introduces stringent requirements on dependability.
We envision more automated approaches to operate communication networks, overcoming today's manual and error-prone approach.
We develop a software tool which performs what-if analysis of computer network configurations (especially MPLS and SR networks). That is, checking policy compliance etc. under network failures.
AN AUTOMATA-THEORY APPROACH
Our approach relies on automata theory: network configurations are automatically collected from the routers and transformed into a push-down automaton, together with the invariants that a network should fulfill. Fast reachability analysis allows to provide verification in minutes or even seconds.
The tool hence disburdens network operators from their most complex
tasks, and ensures a high dependability.
AUTOMATION FOR DEPENDABILITY
Use Cases

TESTING POLICY
COMPLIANCE OF
NETWORK

TESTING
REACHABILITY AND
LOOP-FREEDOM

TESTING
WAYPOINT
ENFORCEMENT
Everything under failures
Our Team

Peter Gjøl
Jensen

Bernhard Clemens
Schrenk

Stefan
Schmid
