Balancing flow table occupancy and link utilization in software-defined networks

Guo, Zehua; Xu, Yang; Liu, Ruoyan; Gushchin, Andrey; Chen, Kuan yin; Walid, Anwar; Chao, H. Jonathan

doi:10.1016/j.future.2018.06.011

Cited by 40 publications

(17 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The author in [28] also propose a dynamic routing approach named DIFF that differentiate flows based on their impact on network resource and adaptively selects appropriate routing paths for them to balance the utilization of flow tables globally, and to mitigate the problems of flowtable overflow and inefficient bandwidth allocation, while increasing network throughput.…”

Section: B Previous Workmentioning

confidence: 99%

Deploying a Fast Detection and Eviction Mechanism of Invalid Connection-Oriented Flow-Entries in SDNs: A Scalability Approach

2020

View full text Add to dashboard Cite

As a new paradigm of network architecture, Software Defined Networking (SDN) has been used in a large number of scenarios because it realizes flexible and efficient fine-grained flow control of the network, and promotes the evolution of the network to a programmable and scalable direction. However, the transition of the traditional networking model to SDN architectures poses scalability issues due to the limitation of the flow-table in size. Facing the traffic explosion on future networks with resourceconstrained architectures, the storage space of the flow-table is not enough to bear so many flow-entries so that it not only causes performance degradation in data delivery but also results in scalability and costefficiency issues. To address this issue, in this article, we propose a solution to expedited evict the invalid flow-entries by detecting the disconnect messages of connection-oriented protocols such as Transmission Control Protocol (TCP) and Stream Control Transmission Protocol (SCTP) based on SDN controller and OpenFlow or programming protocol-independent packet processors (P4) switches. The behavior of detection is achieved by adding a specific SDN ruleset within the transport-layer in between the controller and switches. Different from the original timeout solutions, our scheme can delete invalid flow-entries in time according to the transmission layer disconnection instead of relying on the original timeout mechanism. Through a series of simulation results. we also demonstrate the superiority of our proposed solution in reducing the flow-entries occupancy and control overhead on controller, and improving the table-miss rate.

show abstract

Section: B Previous Workmentioning

confidence: 99%

Deploying a Fast Detection and Eviction Mechanism of Invalid Connection-Oriented Flow-Entries in SDNs: A Scalability Approach

2020

View full text Add to dashboard Cite

show abstract

“…The decay factor β forces some capacity to be left aside to handle burst traffic as described before. Constraint (7) indicates that x ik are binary variables. The condition on connecting each switch to exactly one master controller at the given time is represented by Constraint (8).…”

Section: Control Resource Consumptionmentioning

confidence: 99%

“…However, the static association between controllers and switches results in long varying controller response times, because traffic in network fluctuates frequently [7]. The existing dynamic controller-switch association mechanisms lead to unreasonable allocation, increasing resource consumption without considering the characteristics of flow.…”

Section: Introductionmentioning

confidence: 99%

Dynamic SDN Controller Association Mechanism Based on Flow Characteristics

Li¹,

Hu²,

Hu³

et al. 2019

IEEE Access

View full text Add to dashboard Cite

In software-defined networking with the distributed control plane, the switches are associated with controllers using only the number of the flow requests as the basis of resource allocation, ignoring the characteristics of flow. To address this issue, we first analyze the control resource consumption of flow requests with different characteristics, and point out that the control resource consumption can be reduced through changing the controller association relationship. Then, we propose the dynamic controller association mechanism based on flow characteristics and design the greedy set coverage algorithm with the coalitional game to reduce both control resource consumption and control traffic overhead. The mechanism is divided into two phases: first, the greedy set coverage algorithm provides a fast algorithm to yield a controller association scheme but leads to an unbalanced association. Based on this algorithm, a coalitional game strategy is introduced to achieve the near-optimal association scheme between controllers and switches through switch migration. The extensive simulations demonstrate that while keeping control traffic overhead low, our mechanism can reduce control resource consumption by about 36% in comparison with the controller load balancing mechanism.INDEX TERMS Software-defined networking, controller association, resource allocation, flow characteristics.

show abstract

“…The deficiency of flow table will lead flow-table overflowed when there are a large number of flows. The flow-table overflow will interrupt the normal transmission of data flows because the corresponding flow entries cannot be installed and increases the burden of the controller to repeatedly update flow tables, degrading network performance [5], [6]. In largescale SDN networks, as all switches need to maintain flow state information, leading the dramatical expansion of flow entry number, SDN flow table space faces serious resource shortages problem [7].…”

Section: Introductionmentioning

confidence: 99%

PASR: An Efficient Flow Forwarding Scheme Based on Segment Routing in Software-Defined Networking

2020

IEEE Access

View full text Add to dashboard Cite

Software-Defined Networking provides flexible and efficient network management. However, the limited flow table space lead to many challenges for SDN networks on flexibility and scalability. In order to achieve efficient routing scheme, we propose an efficient flow forwarding scheme based on Segment Routing named PASR to solve SDN switch flow table resource shortage problem. Traditional OpenFlow-based or MPLS-based flow forwarding scheme may lead to performance degradation due to flow-table overflowed or heavy MPLS label load incurred. PASR exploits SDN, Segment Routing and intelligent path encoding algorithm to achieve a trade-off between flow table resource and MPLS label load. The proposed PASR can learn the flow path information online to implement path aggregation by aggregating a large number of flows into a small number of flow entries based on the coincidence degree of the flow path. To find the optimal flow path aggregation scheme, we present an intelligent encoding algorithm to maximize the overall cost saving. The simulation results show that PASR can effectively reduce both the number of flow entries and the MPLS label load of the packet. INDEX TERMS Software-defined networking (SDN), segment routing (SR), path encoding, flow table.

show abstract

Balancing flow table occupancy and link utilization in software-defined networks

Cited by 40 publications

References 11 publications

Deploying a Fast Detection and Eviction Mechanism of Invalid Connection-Oriented Flow-Entries in SDNs: A Scalability Approach

Deploying a Fast Detection and Eviction Mechanism of Invalid Connection-Oriented Flow-Entries in SDNs: A Scalability Approach

Dynamic SDN Controller Association Mechanism Based on Flow Characteristics

PASR: An Efficient Flow Forwarding Scheme Based on Segment Routing in Software-Defined Networking

Contact Info

Product

Resources

About