MpFPC–A Parallelization Method for Fast Packet Classification
Packet classification is the core technology of network layer and an important means to ensure the security of network system. With the rapid development of network technology, higher requirements are put forward for the speed of network packet classification. This paper improves the traditional sin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9753663/ |
| _version_ | 1798038398313693184 |
|---|---|
| author | Yuzhu Cheng Qiuying Shi |
| author_facet | Yuzhu Cheng Qiuying Shi |
| author_sort | Yuzhu Cheng |
| collection | DOAJ |
| description | Packet classification is the core technology of network layer and an important means to ensure the security of network system. With the rapid development of network technology, higher requirements are put forward for the speed of network packet classification. This paper improves the traditional single thread package classification framework, A new parallelization method for fast packet classification (MpFPC) based on distributed computing is proposed, the method adopts the packet classification idea based on decision tree, but compared with the traditional algorithm, a rule mapping preprocessing process is added before constructing the classification decision tree, which effectively removes the rule redundancy and conflict, so as to avoid the rule replication problem of the traditional decision-tree-based method. In addition, the method can group the rules and data packets at the same time, which improves the packet classification efficiency. Experimental results show that MpFPC method has high classification efficiency and has obvious speed advantage compared with Uscuts method with time complexity of <inline-formula> <tex-math notation="LaTeX">$O(k$ </tex-math></inline-formula>log<inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>). In addition, the test results also show that the classification speed of MpFPC will increase with the increasing number of computing nodes, which provides a new possible way to meet the classification wire-speed requirement. |
| first_indexed | 2024-04-11T21:39:39Z |
| format | Article |
| id | doaj.art-aca8e7a0e5a743f5905c9972287741bc |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-11T21:39:39Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-aca8e7a0e5a743f5905c9972287741bc2022-12-22T04:01:39ZengIEEEIEEE Access2169-35362022-01-0110383793839010.1109/ACCESS.2022.31651579753663MpFPC–A Parallelization Method for Fast Packet ClassificationYuzhu Cheng0https://orcid.org/0000-0001-8025-5000Qiuying Shi1School of Software, Changsha Social Work College, Changsha, ChinaSchool of Computer Science and Engineering, Central South University, Changsha, ChinaPacket classification is the core technology of network layer and an important means to ensure the security of network system. With the rapid development of network technology, higher requirements are put forward for the speed of network packet classification. This paper improves the traditional single thread package classification framework, A new parallelization method for fast packet classification (MpFPC) based on distributed computing is proposed, the method adopts the packet classification idea based on decision tree, but compared with the traditional algorithm, a rule mapping preprocessing process is added before constructing the classification decision tree, which effectively removes the rule redundancy and conflict, so as to avoid the rule replication problem of the traditional decision-tree-based method. In addition, the method can group the rules and data packets at the same time, which improves the packet classification efficiency. Experimental results show that MpFPC method has high classification efficiency and has obvious speed advantage compared with Uscuts method with time complexity of <inline-formula> <tex-math notation="LaTeX">$O(k$ </tex-math></inline-formula>log<inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>). In addition, the test results also show that the classification speed of MpFPC will increase with the increasing number of computing nodes, which provides a new possible way to meet the classification wire-speed requirement.https://ieeexplore.ieee.org/document/9753663/Packet classificationcell spacedecision treeparallel computing |
| spellingShingle | Yuzhu Cheng Qiuying Shi MpFPC–A Parallelization Method for Fast Packet Classification IEEE Access Packet classification cell space decision tree parallel computing |
| title | MpFPC–A Parallelization Method for Fast Packet Classification |
| title_full | MpFPC–A Parallelization Method for Fast Packet Classification |
| title_fullStr | MpFPC–A Parallelization Method for Fast Packet Classification |
| title_full_unstemmed | MpFPC–A Parallelization Method for Fast Packet Classification |
| title_short | MpFPC–A Parallelization Method for Fast Packet Classification |
| title_sort | mpfpc x2013 a parallelization method for fast packet classification |
| topic | Packet classification cell space decision tree parallel computing |
| url | https://ieeexplore.ieee.org/document/9753663/ |
| work_keys_str_mv | AT yuzhucheng mpfpcx2013aparallelizationmethodforfastpacketclassification AT qiuyingshi mpfpcx2013aparallelizationmethodforfastpacketclassification |