无线Mesh网络中一种基于模糊评判的风险评估机制.pdf

HMPC: A Multi-fields Fast Packet Classification Algorithm 1 2** Tong Haiqi , Bao Xiuguo 5 (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) Abstract: With the increasing popularity of Internet and new network applications, there has been a 10 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 15 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. Key words: packet classification; multi-fields; dimension decomposition; hash table. 20 0 Introduction With the growing scale of the Internet, as well as its evolving architecture, virtual private networks, policy-based routing, differentiated services, traffic restrictions and other new network services have attracted widespread conce