Reducing Flow Table Update Costs in Software-Defined Networking
Sensors · 23.11.2023 · 23 (23) · 9375
DOI: 10.3390/s23239375 ↗Kurz gefasst
Fachartikel in der Zeitschrift Sensors, online erschienen am 23.11.2023. Verfasst von Wen Wang und 3 weiteren Autor:innen. Beteiligte Einrichtung: Academy of Military Sciences, Beijing 100141, China. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In software-defined networking (SDN), the traffic forwarding delay highly depends on the latency associated with updating the forwarding rules in flow tables. With the increase in fine-grained flow control requirements, due to the flexible control capabilities of SDN, more rules are being inserted and removed from flow tables. Moreover, the matching fields of these rules might overlap since multiple control domains might generate different rules for similar flows. This overlap implies dependency relationships among the rules, imposing various restrictions on forwarding entries during updates, e.g., by following update orders or storing entries at specified locations, especially in flow tables implemented using ternary content addressable memory (TCAM); otherwise, mismatching or packet dropping will occur. It usually takes a while to resolve and maintain dependencies during updates, which hinders high forwarding efficiency. To reduce the delay associated with updating dependent rules, in this paper, we propose an updating algorithm for TCAM-based flow tables. We formulate the TCAM maintenance process as an NP-hard problem and analyze the inefficiency of existing moving approaches. To solve the problem, we propose an optimal moving chain for single rule updates and provide theoretical proof for its minimum moving steps. For multiple rules arriving at a switch simultaneously, we designed a dynamic approach to update concurrent entries; it is able to update multiple rules heuristically within a restricted TCAM region. As the update efficiency concerns dependencies among rules, we evaluate our flow table by updating algorithms with different dependency complexities. The results show that our approach achieves about 6% fewer moving steps than existing approaches. The advantage is more pronounced when the flow table is heavily utilized and rules have longer dependency chains.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Academy of Military Sciences, Beijing 100141, China.
ORCID-Profile: Wen Wang
Zitieren
APA
Wang, W., Yang, L., Yang, X., & Wang, J. (2023). Reducing Flow Table Update Costs in Software-Defined Networking. Sensors, 23(23), 9375. https://doi.org/10.3390/s23239375
Vancouver
Wang W, Yang L, Yang X, Wang J. Reducing Flow Table Update Costs in Software-Defined Networking. Sensors. 2023;23(23):9375. doi:10.3390/s23239375
BibTeX
@article{Wang2023,
author = {Wang, Wen and Yang, Lin and Yang, Xiongjun and Wang, Jingchao},
title = {Reducing Flow Table Update Costs in Software-Defined Networking},
journal = {Sensors},
year = {2023},
volume = {23},
number = {23},
pages = {9375},
doi = {10.3390/s23239375}
}
EUVIMED