A PARALLELED PACKET CLASSIFICATION ALGORITHM BASED ON PLUS BITS AND BLOOM FILTER
Packet classification (PC) is an important technology for next generation network services. Even though some PC algorithms for IPv6 have been proposed, most of them are precluded from commercial equipments due to high memory requirements, low searching speed, or expensive cost. In this paper, we propose an efficient paralleled IPv6 packet classification scheme; called Plus Bits and Bloom Filter based Packet Classification (B3PC). It introduces a small structure, called Plus Bits, which takes only 20 bits and can reduce many memory accesses by a few CPU operations. Meanwhile, we design a new searching scheme to make the highest priority match performance comparable to most specific match. Experimental results show that the hardware implementation of this scheme handles 4K rules by involving few memory, and finds the highest priority rule in about 8 memory accesses without regard to the single field searching.
Plus Bits IPv6 Packet classification
Wenjie Li Yun Liu Xiaohong Huang Qiong Sun Yan Ma
Research Institute of Networking Technology, Beijing University of Posts and Telecommunications, Bei Research Institute of Networking Technology, Beijing University of Posts and Telecommunications, Bei
国际会议
北京
英文
79-84
2009-11-06(万方平台首次上网日期,不代表论文的发表时间)