J Shanghai Jiaotong Univ Sci

Journal of Shanghai Jiaotong University(Science) >

2011 , Vol. 16 >Issue 5: 567 - 570

DOI: https://doi.org/10.1007/s12204-011-1190-8

Articles

Bit Stream Oriented Enumeration Tree Pruning Algorithm

Expand
  • (1. School of Information Security Engineering, Shanghai Jiaotong University,
    Shanghai 200240, China; 2. National Science and Technology on Communication Information
    Security Control Laboratory, No. 36 Institute of China Electronics Technology Group Corporation, Jiaxing 314033, Zhejiang, China)     (1. School of Information Security Engineering, Shanghai Jiaotong University,
    Shanghai 200240, China; 2. National Science and Technology on Communication Information
    Security Control Laboratory, No. 36 Institute of China Electronics Technology Group Corporation, Jiaxing 314033, Zhejiang, China)  

Received date: 2011-03-10

  Online published: 2011-10-20

Fold

Abstract

Abstract:  Packet analysis is very important in our digital life. But
what protocol analyzers can do is limited because they can only process data
in determined format. This paper puts forward a solution to decode raw
data in an unknown format. It is certain that data can be cut into packets
because there are usually characteristic bit sequences in packet headers.
The key to solve the problem is how to find out those characteristic
sequences. We present an efficient way of bit sequence enumeration. Both
Aho-Corasick (AC) algorithm and data mining method are used to reduce the
cost of the process.

Key words： pattern matching; data mining, frequent set; frequent sequence;
association rule

Cite this article

QIU Wei-dong (邱卫东), JIN Ling (金 凌), YANG Xiao-niu (杨小牛), YANG Hong-wa (杨红娃) . Bit Stream Oriented Enumeration Tree Pruning Algorithm[J]. Journal of Shanghai Jiaotong University(Science), 2011 , 16(5) : 567 -570 . DOI: 10.1007/s12204-011-1190-8

References

[1]  Hume A, Sunday D. Fast string searching [J].

Software: Practice and Experience, 1991,  21(11), 1221-1248.
[2]  Knuth D E, Pratt V R. Fast pattern matching in strings [J].  SIAM Journal on Computing, 1977,

6(2): 323-350.
[3]  Aho A V, Corasick M J. Efficient string matching: An aid to

bibliographic search [J].  Communications of the ACM, 1975,  18(6): 333-340.
[4]  Han J, Pei J, Yin Y, et al. Mining frequent patterns without candidate

generation [J].  Data Mining and Knowledge Discovery, 2004,  8(1): 53-87.
[5]  Agrawal R, Mielinsk T, Swami A. Mining association rules between sets of

items in large databases [C]//  Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. New York , USA: ACM Press, 1993: 207-216.
 
Options
Outlines

/

〈 〉