Scheduling and fast response of SDN flow table updates

被引：0
|
作者：
Zhang T. [1 ]
Chen Z. [1 ]
Liu B. [1 ]
机构：
[1] Department of Computer Science and Technology, Tsinghua University, Beijing
来源：
Qinghua Daxue Xuebao/Journal of Tsinghua University | 2022年 / 62卷 / 05期
基金：
美国国家科学基金会;
关键词：
Flow table updates; Software-defined networking (SDN); Ternary content addressable memory (TCAM);
D O I：
10.16511/j.cnki.qhdxxb.2022.22.013
中图分类号：
学科分类号：
摘要：
In software-defined networking (SDN), the overlapping among the matching fields of rules complicates flow table updates. One update often triggers the movement of multiple ternary content addressable memory (TCAM) entries, which increases the update times. In addition, the TCAMs in existing SDN switches are mostly designed with a single port. The TCAM update suspends the packet lookup which affects the packet forwarding in the data plane. Therefore, how to achieve fast update while supporting wire-speed packet lookup is an important research topic to improve network performance. This paper presents a TCAM-based SDN switch with a flow table update system. When multiple network application updates are integrated at the front end and simultaneously sent to the switch, the system can efficiently detect the dependencies between rules and prioritize the rules which need to be quickly updated, so that they can respond quickly. The update algorithm does not need to block the TCAM search operation and can provide interleaved execution of the packet lookups and rule updates. Tests show that these scheduling strategies improve the system performance by balancing the lookup first algorithm and the update first algorithm. © 2022, Tsinghua University Press. All right reserved.
引用
收藏
页码：917 / 925
页数：8
相关论文
共 14 条
  • [1] CASADO M, FREEDMAN M J, PETTIT J, Et al., Rethinking enterprise network control, IEEE/ACM Transactions on Networking, 17, 4, pp. 1270-1283, (2009)
  • [2] HONG C Y, CAESAR M, GODFREY P., Finishing flows quickly with preemptive scheduling, ACM Special Interest Group on Data Communication (SIGCOMM) Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 127-138, (2012)
  • [3] BENSON T, ASHOK A, ADITYA A, Et al., MicroTE: Fine grained traffic engineering for data centers, Proceedings of the Seventh Conference on Emerging Networking Experiments and Technologies (CoNEXT), pp. 1-12, (2011)
  • [4] JIN X, LI E L, VANBEVER L, REXFORD J., SoftCell: Scalable and flexible cellular core network architecture, Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies (CoNEXT), pp. 163-174, (2013)
  • [5] HE P, ZHANG W Y, GUAN H T, Et al., Partial order theory for fast TCAM updates, IEEE/ACM Transactions on Networking (TON), 26, 1, pp. 217-230, (2018)
  • [6] WAN Y, SONG H Y, CHE H, Et al., FastUp: Fast TCAM update for SDN Switches in datacenter networks, 41st International Conference on Distributed Computing Systems (ICDCS), pp. 887-897, (2021)
  • [7] WEN X T, YANG B, CHEN Y, Et al., RuleTris: Minimizing rule update latency for TCAM-based SDN switches, 36th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 179-188, (2016)
  • [8] QIU K, YUAN J, ZHAO J, Et al., FastRule: Efficient flow entry updates for TCAM-based OpenFlow switches, IEE Journal on Selected Areas in Communications, 37, 3, pp. 484-498, (2019)
  • [9] WANG Z J, CHE H, KUMAR M, Et al., COPTUA: Consistent policy table update algorithm for TCAM without locking, IEEE Transactions on Computers, 53, 12, pp. 1602-1614, (2004)
  • [10] MISHRA T, SAHNI S., Duo-dual TCAM architecture for routing tables with incremental update, IEEE Symposium Computers and Communications (ISCC), pp. 503-508, (2010)
12