A Survey on TCAM Storage Optimization for SDN Switch Forwarding Rules

被引:0
|
作者
Chen Z.-P. [1 ,2 ]
Xu M.-W. [1 ,2 ]
Yang Y. [1 ,2 ]
机构
[1] Department of Computer Science&Technology, Tsinghua University, Beijing
[2] Beijing National Research Center for Information Science and Technology, Beijing
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2021年 / 44卷 / 07期
关键词
Software Defined Networking (SDN); Storage optimization for forwarding rules; Ternary Content Addressable Memory (TCAM);
D O I
10.11897/SP.J.1016.2021.01341
中图分类号
学科分类号
摘要
Software Defined Networking (SDN) makes network control more convenient and more flexible by decoupling the control plane and the data plane. The controller interacts with switches through specific control protocols such as OpenFlow, and rules for forwarding packets will be installed or updated in the switches. Ternary Content Addressable Memory (TCAM) is the most widely used storage medium for forwarding rules in modern SDN switches due to its fast lookup. TCAM supports parallel lookup and outputs the results in one clock cycle. Besides, TCAM can store rules with wildcard directly, which is common in OpenFlow networks. However, TCAM suffers the shortcomings of high cost, high power consumption, and the problem of range expansion when storing range-field-contained forwarding rules. As is known to all, OpenFlow has been the most widely used control protocol at present, and the OpenFlow protocol standard has specified more than 40 match fields according to its latest version. The number of match fields is still growing to achieve high quality network performance. Therefore, forwarding rules in an OpenFlow switch specify longer bits and occupy more room in TCAM than those in a traditional L2 or L3 switch. Therefore, the number of forwarding rules that TCAM can store is very limited, especially the OpenFlow forwarding rules with various match fields. It becomes a bottleneck of software-defined network development. In order to efficiently utilize the limited TCAM storage resources for forwarding rules, it is necessary to optimize the storage problem of forwarding rules in SDN. This paper mainly analyses and summarizes TCAM storage optimization mechanisms of forwarding rules in SDN from such four perspectives as forwarding rule storage architecture optimization, compression of forwarding rules locally and globally, management of forwarding rules with the participation of controller(s). First, forwarding rule storage architecture optimization aims at improving lookup circuit structure in switches, replacing TCAM with better storage media, or applying a mix storage scheme of multiple storage medium. Most methods involve hardware modification. Storing multiple sub-tables rather than the original rule table can improve the storage utilization in TCAM. It is often necessary to maintain information of jump instruction. Second, we can adopt compression algorithms to reduce the number of rules under the premise of keeping rule table semantics unchanged. Compression algorithms need to be effective and efficient, and can compress rule table with high dimension. Third, rule table storage pressure can be relieved by optimizing the routing of flows globally in SDN networks. For example, one rule can be multiplexed by multiple flows in specific network segments, through which the number of rules is reduced. Algorithms are developed in the direction of reducing the number of rules among the entire network. Fourth, Management of forwarding rules with the participation of controller (s) includes caching of forwarding rules or flow table overflow control through specifically designed modules. The module is designed in controllers or additional layer(s) between the control and data plane. However, none of the above four solutions can solve the TCAM storage problem thoroughly. Each of them suffers certain limitations such as overhead of hardware modification, high algorithm complexity, algorithm ineffectiveness and so on. Therefore, we discussed the comprehensive schemes of forwarding rule optimization suitable for future SDN at last. © 2021, Science Press. All right reserved.
引用
收藏
页码:1341 / 1362
页数:21
相关论文
共 117 条
  • [1] Mckeown N, Anderson T, Balakrishnan H, Et al., OpenFlow: Enabling innovation in campus networks, ACM SIGCOMM Computer Communication Review, 38, 2, pp. 69-74, (2008)
  • [2] Li Ji-Zhou, He En, Technologies and future development trend of software-defined networking, Communications Technology, 47, 2, pp. 123-127, (2014)
  • [3] Yu F, Katz R H, Lakshman T V., Gigabit rate packet pattern-matching using TCAM, Proceedings of the 12th IEEE International Conference on Network Protocols, pp. 174-183, (2004)
  • [4] Kannan K, Banerjee S., Compact TCAM: Flow entry compaction in TCAM for power aware SDN, Proceedings of the International Conference on Distributed Computing and Networking, pp. 439-444, (2013)
  • [5] Agrawal B, Sherwood T., Modeling TCAM power for next generation network devices, Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, pp. 120-129, (2006)
  • [6] Kandula S, Sengupta S, Greenberg A, Et al., The nature of data center traffic: Measurements & analysis, Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement, pp. 202-208, (2009)
  • [7] Shalimov A, Zuikov D, Zimarina D, Et al., Advanced study of SDN/OpenFlow controllers, Proceedings of the 9th Central & Eastern European Software Engineering Conference, pp. 1-6, (2013)
  • [8] Srinivasan V, Varghese G, Suri S, Et al., Fast and scalable layer four switching, Proceedings of the ACM SIGCOMM'98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 191-202, (1998)
  • [9] Singh S, Baboescu F, Varghese G, Et al., Packet classification using multidimensional cutting, Proceedings of the ACM SIGCOMM'03 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 213-224, (2003)
  • [10] Gupta P, McKeown N., Packet classification using hierarchical intelligent cuttings, Proceedings of the Hot Interconnects VII, pp. 34-41, (1999)