Detecting Persistent User Behavior Using Probabilistic Counting in Network-Wide View

Algorithm 1

Updating data structure.

	Input: initialize Bi, 1 ≤ i ≤ r
	Output: the updated Bi, 1 ≤ i ≤ r
(1)	for each timeslot t do
(2)	for each packet do
(3)	vextract user ID u
(4)	compute , 1 ≤ j ≤ k
(5)	compute , 1 ≤ j ≤ k
(6)	set the bit of Bi to one
(7)	end for
(8)	end for