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

Algorithm 1

Updating summary data structures.

	Input: initialize B^r = , 1 ≤ r ≤ R
	Output: the updated B = (B1, B2, …, BH)
(1)	for each packet arriving at the monitor r do
(2)	extract its flow label (st, dt)
(3)	compute fi (st), 1 ≤ i ≤ H
(4)	compute hi (dt), 1 ≤ i ≤ H
(5)	← 1, 1 ≤ i ≤ H, 1 ≤ r ≤ R
(6)	end for
(7)	Bi[j][k] ← , 1 ≤ i ≤ H