A Low-Overhead and High-Precision Attack Traceback Scheme with Combination Bloom Filters

Table 2

Notations used in this paper.

Notations	Interpretation
	The length of BF1
	The length of BF2
	The number of hash functions in BF1
	The number of hash functions in BF2
	The number of programmable switches inserted into BF1
	The number of programmable switches inserted into BF2
	The marking probability of the switch
d	The path length of the switch from victim host (in hops)
N	The total number of switches in the network topology
n	The constant value is equal to N in most cases
i	The path length of the marked switch from the attack source (in hops)
	The path length of the marked switch to the victim host (in hops)
c	The constant value