Entry Aggregation and Early Match Using Hidden Markov Model of Flow Table in SDN
AbstractThe usage of multiple flow tables (MFT) has significantly extended the flexibility and applicability of software-defined networking (SDN). However, the size of MFT is usually limited due to the use of expensive ternary content addressable memory (TCAM). Moreover, the pipeline mechanism of MFT causes long flow processing time. In this paper a novel approach called Agg-ExTable is proposed to efficiently manage the MFT. Here the flow entries in MFT are periodically aggregated by applying pruning and the Quine–Mccluskey algorithm. Utilizing the memory space saved by the aggregation, a front-end ExTable is constructed, keeping popular flow entries for early match. Popular entries are decided by the Hidden Markov model based on the match frequency and match probability. Computer simulation reveals that the proposed scheme is able to save about 45% of space of MFT, and efficiently decrease the flow processing time compared to the existing schemes. View Full-Text
Share & Cite This Article
Wang, C.; Youn, H.Y. Entry Aggregation and Early Match Using Hidden Markov Model of Flow Table in SDN. Sensors 2019, 19, 2341.
Wang C, Youn HY. Entry Aggregation and Early Match Using Hidden Markov Model of Flow Table in SDN. Sensors. 2019; 19(10):2341.Chicago/Turabian Style
Wang, Cheng; Youn, Hee Y. 2019. "Entry Aggregation and Early Match Using Hidden Markov Model of Flow Table in SDN." Sensors 19, no. 10: 2341.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.