Dynamic flow aggregation in SDNs for application-aware routing

The software defined network (SDN) presents a good opportunity to realize application-aware routing by offering programmability for the network. Due to limited sizes of ternary content addressable memories (TCAMs) in SDN switches, flow aggregation is needed to resolve the flow table overflow problem. We propose bit & subset weaving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset weaving to merge flow entries in each subset of a partition. Comparing with the Fast Flow Table Aggregation (FFTA) scheme [7], the average compression ratio (the average flow aggregation time) of the proposed bit & subset weaving is better (smaller) than that of FFTA.

[1]  Lemin Li,et al.  Fast incremental flow table aggregation in SDN , 2014, 2014 23rd International Conference on Computer Communication and Networks (ICCCN).

[2]  Eric Torng,et al.  Bit Weaving: A Non-Prefix Approach to Compressing Packet Classifiers in TCAMs , 2012, IEEE/ACM Transactions on Networking.

[3]  Ieee Staff 2014 9th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP) , 2014 .

[4]  Deng Pan,et al.  OpenFlow based Load Balancing for Fat-Tree Networks with Multipath Support , 2013 .

[5]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[6]  Ananth Balashankar,et al.  Software Defined Networking , 2019, 2019 19th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA).

[7]  Minyi Guo,et al.  LABERIO: Dynamic load-balanced Routing in OpenFlow-enabled Networks , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[8]  Keith Kirkpatrick,et al.  Software-defined networking , 2013, CACM.

[9]  Christophe Diot,et al.  On the impact of aggregation on the performance of traffic aware routing , 2001 .

[10]  Brian Zill,et al.  Constructing optimal IP routing tables , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Ting Wang,et al.  QoS-aware optical burst switching in OpenFlow based Software-Defined Optical Networks , 2013, 2013 17th International Conference on Optical Networking Design and Modeling (ONDM).