Home > Papers

 
 
HMPC: A Multi-fields Fast Packet Classification Algorithm
Tong Haiqi 1 #,Bao Xiuguo 2 *
1.School of Information and Communication Engineer, Beijing University of Posts and Telecommunications,Beijing 100876
2.National Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing 100029
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:31 December 2014
Accepted by: none
Citation: Tong Haiqi,Bao Xiuguo.HMPC: A Multi-fields Fast Packet Classification Algorithm[OL]. [31 December 2014] http://en.paper.edu.cn/en_releasepaper/content/4625278
 
 
With the increasing popularity of Internet and new network applications, there has been a great concern on how to classify packets rapidly and accurately. In this paper we propose a Hash Multi-fields Packet Classification (HMPC) algorithm based on dimension decomposition. This algorithm maps the fields of the packet to the rule table through a single step, and then it combines the multi-fields mapping results via hash method. The HMPC algorithm can drastically improve space and time performance by adjusting the hash table structure design. The experimental results show that the space consumption of HMPC algorithm is 53% and 12% lower than Recursive Flow Classification (RFC) and Hierarchical Space Mapping (HSM) algorithms respectively, while maintaining a similar time performance with HSM.
Keywords:packet classification; multi-fields; dimension decomposition; hash table.
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 60
Bookmarked 0
Recommend 5
Comments Array
Submit your papers