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

Algorithm 3

Detecting supersources and superdestinations.

	Input: the updated B = (B1, B2, …, BH)
	Output: supersources and destinations
(1)	fori = 1 to H do
(2)	compute the number of zero bits in each Bi [ j] [·]
(3)	←  , 0 ≤ j ≤ ni − 1
(4)	if > αithen
(5)	the row Bi [j] [·] is an abnormal row
(6)	end if
(7)	compute the number of zero bits in each Bi [·] [j]
(8)	← , 0 ≤ j ≤ mi − 1
(9)	if > βithen
(10)	the column Bi [·] [j] is an abnormal column
(11)	end if
(12)	end for
(13)	Obtain supersources and destinations by inverse calculation