Adaptive and Hybrid Idle–Hard Timeout Allocation and Flow Eviction Mechanism Considering Traffic Characteristics

Isyaku, Babangida; Bakar, Kamalrulnizam Abu; Zahid, Mohd Soperi Mohd; Yusuf, Muhammed Nura

doi:10.3390/electronics9111983

Cited by 10 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, in this work, we have jointly considered the optimized node selection and statistics collection to reduce the communication cost and delay, as detailed in Section 4. Compared with previous works, 13,19,20 our proposed scheme does not depend on any flow path information.…”

Section: Flow Statistics Costmentioning

confidence: 97%

“…Most existing node selection works assume that the controller has complete routing knowledge about flows. 19,20 Nevertheless, in large-scale networks, fast flow processing requires efficient storage and rapid updating of knowledge, which is knotty to perform under cost constraints. Worse, even without considering the cost, privacy concerns will become another obstacle.…”

Section: Measurement Point Selectionmentioning

confidence: 99%

“…Table‐miss rules with high priority are given adaptive idle_timeout by Q‐learning logic, and dependent rules are removed to comply with forwarding consistency proactively. Isyaku et al 20 used traffic patterns and flow table utilization as criteria to configure a characteristic timeout value for flows, which was a mixture of idle_timeout value and hard_timeout value.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Cost‐effective and accurate flow statistics collection in OpenFlow‐based SDN

et al. 2022

View full text Add to dashboard Cite

Summary Network resource scheduling and optimization require the acquisition of status information as a basis. High‐cost solutions lead to more resource consumption but only bring negligible benefits. To address this challenge, this paper proposes a novel statistics collection method adapted to OpenFlow‐based SDN, which can reduce the measurement cost while ensuring the statistical accuracy. First, based on the complex network theory, we propose multi‐path weighted closeness centrality (MWCC) to perform importance ranking on network switching nodes, which helps us select top‐k key nodes for statistical collection to reduce the overhead. Second, we propose an adaptive flow rule timeout mechanism AFRT. AFRT continuously optimizes the rule timeout values based on statistical results, further balancing flow table overhead and statistical accuracy. A series of simulation results on real network topologies verify the superiority of the proposed method in terms of communication cost, statistical accuracy, and time consumption, compared with the existing representative methods.

show abstract

Section: Flow Statistics Costmentioning

confidence: 97%

Section: Measurement Point Selectionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Cost‐effective and accurate flow statistics collection in OpenFlow‐based SDN

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Conversely, when the polling interval value is short, then it increased the communication overhead switch-controller. Therefore, completely depending on the controller to pull the data of total active flows to obtain the usage of the Flow Table may not be the best solution [113].…”

Section: Load Balancing Schemesmentioning

confidence: 99%

Dynamic Routing and Failure Recovery Approaches for Efficient Resource Utilization in OpenFlow-SDN: A Survey

et al. 2022

Self Cite

View full text Add to dashboard Cite

Software Defined Networks (SDN) is a new network paradigm that emerged to offer better network management through the separation of network control logic and data forwarding element. This separation speed up network innovation without the need to rely on the vendor-proprietary interface for network element configuration to forward packets. However, SDN is flow driven network, for each arrived flow, a feasible path is computed to forward the flow to its destination. Afterward, the SDN control logic process the corresponding routing and instruct the set of data forwarding elements to install them on their Flowtable to guide the routing process. Unfortunately, the network changes more frequently in dynamic large-scale networks and the Flowtable is a constraint with limited space. These challenges require the SDN controller to compute paths more often which may also need a large number of flow routing rules placement. In addition, the frequency of communication link failures increases lately. The successful deployment of SDN heavily depends on how it satisfies the reliability requirement with uninterrupted services. Several studies were conducted to compute the optimal path for data forward to meet their Quality of Service demand. Other studies focus on reducing the frequency of link failure. Some studies were conducted to manage the constraint Flowtable resources. This survey focuses on Routing rules placement, unoptimized routing, link, and switch load balancing, failure detection, and recovery. The paper extensively discusses each issue and analyzes the weakness of the current solutions. Finally, it highlights potential challenges that need future research attention.

show abstract

“…However, when the network operation state changes because of dense flow arrival or timeout. To avoid frequent expiration of flow rules, an advance timeout setting is can be found at [35]. The affected path is obtained, and the set of old rules are removed and replaced with new rules.…”

Section: Critical Switch Detection and Expected Loadmentioning

confidence: 99%

Route Path Selection Optimization Scheme Based Link Quality Estimation and Critical Switch Awareness for Software Defined Networks

et al. 2021

Self Cite

View full text Add to dashboard Cite

Software-defined network (SDN) is a new paradigm that decouples the control plane and data plane. This offered a more flexible way to efficiently manage the network. However, the increasing number of traffics due to the proliferation of the Internet of Things (IoT) devices also increase the number of flow arrival which in turn causes flow rules to change more often, and similarly, path setup requests increased. These events required route path computation activities to take place immediately to cope with the new network changes. Searching for an optimal route might be costly in terms of the time required to calculate a new path and update the corresponding switches. However, the current path selection schemes considered only single routing metrics either link or switch operation. Incorporating link quality and switch’s role during path selection decisions have not been considered. This paper proposed Route Path Selection Optimization (RPSO) with multi-constraint. RPSO introduced joint parameters based on link and switches such as Link Latency (LL), Link Delivery Ratio (LDR), and Critical Switch Frequency Score (CWFscore). These metrics encourage path selection with better link quality and a minimal number of critical switches. The experimental results show that the proposed scheme reduced path stretch by 37%, path setup latency by 73% thereby improving throughput by 55.73%, and packet delivery ratio by 12.5% compared to the baseline work.

show abstract

Adaptive and Hybrid Idle–Hard Timeout Allocation and Flow Eviction Mechanism Considering Traffic Characteristics

Cited by 10 publications

References 26 publications

Cost‐effective and accurate flow statistics collection in OpenFlow‐based SDN

Cost‐effective and accurate flow statistics collection in OpenFlow‐based SDN

Dynamic Routing and Failure Recovery Approaches for Efficient Resource Utilization in OpenFlow-SDN: A Survey

Route Path Selection Optimization Scheme Based Link Quality Estimation and Critical Switch Awareness for Software Defined Networks

Contact Info

Product

Resources

About