supporting fast incremental update. The algorithm uses decision trees to partition mask matching rules. To guarantee the update performance
it restricts that rules residing in different leaf nodes do not overlap with each other. At the same time
TernarySort selects effective bits to reduce the depth of decision trees. And it allows rules to overlap in one leaf node
to decrease the number of partitions and improve the classification performance. The experimental results show that
compared to currently used algorithms
TernarySort can improve packet classification performance by more than 80% while maintaining fast rule updating performance. TernarySort meets the requirements of SDN for mask matching algorithms.
关键词
Keywords
references
MCKEOWN N, AANDERSON T, BALAKRISHNAN H, et al. OpenFlow: enabling innovation in campus networks[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 69-74. DOI: 69
SRINIVASAN V, SURI S, VARGHESE G. Packet Classification Using Tuple Space Search[A]. Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication[C]. New York, NY, USA: ACM, 1999: 135-146.
DALY J, TORNG E. TupleMerge: Building Online Packet Classifiers by Omitting Bits[A]. 2017 26th International Conference on Computer Communication and Networks (ICCCN)[C]. 2017: 1-10.
TAYLOR D E, TURNER J S. Classbench: A packet classification benchmark[J]. IEEE/ACM Transactions on Networking (TON), 2007, 15(3): 499-511. DOI: 499
PFAFF B, PETTIT J, KOPPNEN T, et al. The Design and Implementation of Open vSwitch[A]. 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)[C]. Oakland, CA: USENIX Association, 2015: 117-130.
HE P, XIE G, SALAMATION K, et al. Meta-algorithms for Software-Based Packet Classification[A]. 2014 IEEE 22nd International Conference on Network Protocols[C]. 2014: 308-319.
GUPTA P, MCKEOWN N. Packet classification using hierarchical intelligent cuttings[A]. Hot Interconnects VII[C]. 1999: 34-41.
YINGCHAREONTHAWORNCHAI S, DALY J, LIU A X, et al. A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet Classification[J]. IEEE/ACM Transactions on Networking, 2018: 1-14. DOI: 1