An Efficient Method for Detecting Supernodes Using Reversible Summary Data Structures in the Distributed Monitoring Systems

Algorithm 2

Estimating cardinality.

	Input: the updated B = (B1, B2, …, BH)
	Output: the estimated source and destination cardinality
(1)	for one source s ∈ S do
(2)	compute fi(s), 1 ≤ i ≤ H
(3)	Bi(s) ⟵ Bi[ fi(s)][·], 1 ≤ i ≤ H
(4)	compute the number of zero bits in each Bi (s)
(5)	⟵  , 1 ≤ i ≤ H
(6)	⟵
(7)	end for
(8)	for one destination d ∈ D do
(9)	compute hi(d), 1 ≤ i ≤ H
(10)	Bi (d) ⟵ Bi [·] [hi (d)], 1i ≤ i ≤ H
(11)	compute the number of zero bits in each Bi (d)
(12)	⟵ , 1 ≤ i ≤ H
(13)	⟵
(14)	end for