Network Programming and Probabilistic Sketching for Securing the Data Plane

Table 4

VISKA average case complexity analysis summary.

Term	Meaning	Value
	The average case runtime complexity of the VISKA malicious switch detection algorithms. designates the network size. Note that is not multiplied by a factor of 2 since the recursion is only applied on one network partition.
	The worst case runtime complexity of the Network Views Partitioning function.	)
	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).