From Unknown to Similar: Unknown Protocol Syntax Analysis for Network Flows in IoT

Table 1

Description of OFS algorithm.

Input	The ideal string set of data preprocessing is ; the data frame set is ; the minimum support is
Output	Frequent item set
(1)	Judge whether is empty
(2)	If it is empty, the algorithm ends; otherwise, the is reprocessed
(3)	Judge whether the is empty. If it is, the algorithm ends. Otherwise, traverse the
(4)	Traverse each piece of data in the in the data frame set
(5)	From each data frame in the , the strings with the same position and length as the data are intercepted and compared. If any substring matches successfully, it will be added to
(6)	Whether the traversal is finished. If not, return to step 4. Otherwise, the data in will be removed and included
(7)	Add the data in to
(8)	Judge whether the traversal of is finished. If not, return to step 3. Otherwise, filter the support of
(9)	Deduplicate
(10)	In the end, the is output as the final frequent item set