Improved space protocol identification algorithm
An improved boyer-moore (BM) algorithm for space protocol identification was proposed.First,a space data preprocessing technique based on bit distance was used to increase the size of data set.A decimal jumping technique was introduced to enhance the matching efficiency for the col head part of the...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)05-0183-08/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | An improved boyer-moore (BM) algorithm for space protocol identification was proposed.First,a space data preprocessing technique based on bit distance was used to increase the size of data set.A decimal jumping technique was introduced to enhance the matching efficiency for the col head part of the BM algorithm.Then,the regular expression method was applied to proceed the protocol identification and the hierarchy associated analysis technique was proposed to improve the efficiency of multi-level space protocol identification.Finally,the complexity of the proposed algorithm was analyzed and verified with concrete experiments.The results show that with the proposed algorithm,as to pattern string length m,the time complexity of the single layer protocol identification can be reduced to (1+m/4)/m of the BM algorithm.The efficiency of the protocol identification for multi-level layers can be improved about 2.5 times.Meanwhile,comparing with BM algorithm,the proposed algorithm can solve the problem of pattern string shortage and large wildcards in the space data.The identification iciency in case of huge data packages can be improved and the new formed data block can restrain the state expansion for the DFA matching engine in regular expression. |
|---|---|
| ISSN: | 1000-436X |