Loop Detection

Detects loops in a network from its forwarding tables. We use an algorithm that only requires set intersection, to avoid the increase in complexity when unions and complements are used.

• Free software: MIT license

• Documentation: https://abaiesu.github.io/loop-detection/.

Features

• Classes for rule representation. Supported types of rules : ranges, wildcard expressions, n-tuples (multi-fields).

• An efficient algorithm to compute the equivalence classes of the header space from a set of rules.

• A loop detection function which returns the nodes and the rules involved in the network loop.

Credits

This package was created with Cookiecutter and the Package Helper 3 project template.