PCHA: A Fast Packet Classification Algorithm For IPv6 Based On Hash And AVL Tree

被引:0
作者
Zhang, Yu-yan [1 ]
Chen, Xing-xing [1 ]
Zhang, Xu [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Network Educ, Beijing, Peoples R China
[2] Beijing Univ Posts & Telecommun, Sch Cyberspace Secur, Natl Engn Lab Mobile Network Secur, Beijing, Peoples R China
来源
2020 IEEE 13TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD 2020) | 2020年
关键词
IPv6; hash; AVL tree; packet classification; high performance;
D O I
10.1109/CLOUD49709.2020.00061
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
As the core infrastructure of cloud data operation, exchange and storage, data centerneeds to ensure its security and reliability, which are the important prerequisites for the development of cloud computing. Due to various illegal accesses, attacks, viruses and other security threats, it is necessary to protect the boundary of cloud data center through security gateway. Since the traffic growing up to gigabyte level, the secure gateway must ensure high transmission efficiency and different network services to support the cloud services. In addition, data center is gradually evolving from IPv4 to IPv6 due to excessive consumption of IP addresses. Packet classification algorithm,which can divide packets into different specific streams, is very important for QoS, real-time data stream application and firewall. Therefore, it is necessary to design a high performance IPv6 packet classification algorithm suitable for security gateway.AsIPv6 has a128-bitIP address and a different packet structure compared with IPv4, the traditional IPv4 packet classification algorithm is not suitable properly for IPv6 situations. This paper proposes a fast packet classification algorithm for IPv6 - PCHA (packet classification based on hash and Adelson-Velsky-Landis Tree). It adopts the three flow classification fields of source IPaddress(SA), destination IPaddress(DA) and flow label(FL) in the IPv6 packet defined by RFC3697 to implement fast three-tuple matching of IPv6 packet.It is through hash matching of variable length IPv6 address and tree matching of shorter flow label. Analysis and testing show that the algorithm has a time complexity close to O(1) in the acceptable range of space complexity, which meets the requirements of fast classification of IPv6 packetsand can adapt well to the changes in the size of rule sets, supporting fast preprocessing of rule sets. Our algorithm supports the storage of 500,000 3-tuple rules on the gateway device and can maintain 75% of the performance of throughput for small packets of 78 bytes.
引用
收藏
页码:397 / 404
页数:8
相关论文
共 22 条
[1]  
[Anonymous], 2001, INTERNET PROTOCOL J
[2]  
Baboescu F, 2003, IEEE INFOCOM SER, P53
[3]   Tree bitmap: Hardware/software IP lookups with incremental updates [J].
Eatherton, W ;
Varghese, G ;
Dittia, Z .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (02) :97-122
[4]  
EATHERTON W, 1999, HARDWARE BASED INTER
[5]  
Feldman A., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P1193, DOI 10.1109/INFCOM.2000.832493
[6]  
Gupta P, 1999, COMP COMM R, V29, P147, DOI 10.1145/316194.316217
[7]   Algorithms for packet classification [J].
Gupta, P ;
McKeown, N .
IEEE NETWORK, 2001, 15 (02) :24-32
[8]   Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines [J].
Jiang, Weirong ;
Prasanna, Viktor K. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2009, 69 (09) :778-789
[9]  
Lakshman T. V., 1998, Computer Communication Review, V28, P203, DOI 10.1145/285243.285283
[10]  
Li WJ, 2018, IEEE INFOCOM SER, P2645, DOI 10.1109/INFOCOM.2018.8485947