Bit Stream Oriented Enumeration Tree Pruning Algorithm

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...

Full description

Saved in:
Bibliographic Details
Published inShanghai jiao tong da xue xue bao Vol. 16; no. 5; pp. 567 - 570
Main Author 邱卫东 金凌 杨小牛 杨红娃
Format Journal Article
LanguageEnglish
Published Heidelberg Shanghai Jiaotong University Press 01.10.2011
Subjects
Algorithms
Architecture
Computer Science
Cost engineering
Digital
Electrical Engineering
Engineering
Enumeration
Format
Life Sciences
Materials Science
Packets (communication)
Pruning
Streams
association rule
pattern matching
frequent set
TP 309
data mining
frequent sequence
Online AccessGet full text
ISSN1007-1172
1995-8188
DOI10.1007/s12204-011-1190-8

Cover

More Information
Summary: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.
Bibliography: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.
pattern matching, data mining, frequent set, frequent sequence, association rule
31-1943/U
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1007-1172
1995-8188
DOI:10.1007/s12204-011-1190-8