Research Article

Network Programming and Probabilistic Sketching for Securing the Data Plane

Table 3

VISKA worst case complexity analysis summary.

TermMeaningValue

The worst case runtime complexity of the VISKA malicious switch detection algorithms. designates the network size.

The worst case runtime complexity of the Network Views Partitioning function. This is typically the cost of the Karger algorithm.)

The worst case runtime complexity of the View Probing and Sketching function. This cost depends on the size of the sketch data structure and not on the network size. Accordingly it can be replaced by an constant .

After solving the recurrence relation in Equation (5).