Flow-Aware Forwarding in SDN Datacenters Using a Knapsack-PSO-Based Solution

With the rapid growth of different massive applications and parallel flow requests in Data Center Networks (DCNs), today’s providers are confronting challenges in flow forwarding decisions. Since Software Defined Networking (SDN) provides fine granular control, it can be intelligently programmed to distinguish between flow requirements. The present article proposes a knapsack model in which the link bandwidth and incoming flows are modeled as a knapsack capacity and items, respectively. Furthermore, each flow consists of two size and value aspects, acquired through flow size extraction and the type of service value assigned by the SDN controller decision. Indeed, the current work splits the incoming flow size range into Type of Service (ToS) decimal value numbers. The lower the flow size category, the higher the value dedicated to the flow. Particle Swarm Optimization (PSO) optimizes the knapsack problem and first forwards the selected-flows by KP-PSO, and the non-selected-flows second. To address the shortcomings of these methods in the event of dense parallel flow detection, the present study puts the link under the threshold of a 70% load by simultaneous requests. Experimental results indicate that the proposed method outperforms Sonum, Hedera, and ECMP in terms of flow completion time, packet loss rate, and goodput regarding flow size requirements.

[1]  Yabo Li,et al.  TRUS: Towards the Real-Time Route Update Scheduling in SDN for Data Centers , 2020, IEEE Access.

[2]  Bruno Volckaert,et al.  Pluggable SDN framework for managing heterogeneous SDN networks , 2020, Int. J. Netw. Manag..

[3]  Jie Li,et al.  SDN based load balancing mechanism for elephant flow in data center networks , 2014, 2014 International Symposium on Wireless Personal Multimedia Communications (WPMC).

[4]  Ali Raza,et al.  A priority based greedy path assignment mechanism in OpenFlow based datacenter networks , 2020, J. Netw. Comput. Appl..

[5]  Yu Wang,et al.  Achieving Near-Optimal Traffic Engineering Using a Distributed Algorithm in Hybrid SDN , 2020, IEEE Access.

[6]  Víctor Parada,et al.  Automatic design of specialized algorithms for the binary knapsack problem , 2020, Expert Syst. Appl..

[7]  Ryan Beckett,et al.  Adaptive Weighted Traffic Splitting in Programmable Data Planes , 2020, SOSR.

[8]  Mohammed J.F. Alenazi,et al.  Utilizing SDN to Deliver Maximum TCP Flow for Data Centers , 2020, ICISS.

[9]  Marcelo Bagnulo,et al.  Bartolomeu: An SDN rebalancing system across multiple interdomain paths , 2020, Comput. Networks.

[10]  Zequn Jia,et al.  cRetor: An SDN-Based Routing Scheme for Data Centers With Regular Topologies , 2020, IEEE Access.

[11]  Deepti Shrimankar,et al.  Effective Resource Management in SDN Enabled Data Center Network Based on Traffic Demand , 2019, IEEE Access.

[12]  Jianxin Wang,et al.  Tuning high flow concurrency for MPTCP in data center networks , 2020, Journal of Cloud Computing.

[13]  Torsten Hoefler,et al.  Bandwidth-optimal all-to-all exchanges in fat tree networks , 2013, ICS '13.

[14]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[15]  Muhammad Imran,et al.  Flow-Aware Elephant Flow Detection for Software-Defined Networks , 2020, IEEE Access.

[16]  Yi Pan,et al.  PTCP: A priority-based transport control protocol for timeout mitigation in commodity data center , 2020, Future Gener. Comput. Syst..

[17]  Mehdi Hosseinzadeh,et al.  Load Balancing Mechanisms in the Software Defined Networks: A Systematic and Comprehensive Review of the Literature , 2018, IEEE Access.

[18]  Divanilson R. Campelo,et al.  Performance evaluation of elephant flow predictors in data center networking , 2020, Future Gener. Comput. Syst..

[19]  Hasibeh Naseri BSFS: A Bidirectional Search Algorithm for Flow Scheduling in Cloud Data Centers , 2020 .

[20]  Juan Chen,et al.  STDPG: A Spatio-Temporal Deterministic Policy Gradient Agent for Dynamic Routing in SDN , 2020, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[21]  Zewen Li,et al.  A Binary Particle Swarm Optimization for Solving the Bounded Knapsack Problem , 2018 .

[22]  Basit Shahzad,et al.  Leveraging the Big Data Produced by the Network to Take Intelligent Decisions on Flow Management , 2018, IEEE Access.

[23]  Pedro Sousa,et al.  Traffic Engineering With Three-Segments Routing , 2020, IEEE Transactions on Network and Service Management.

[24]  Bibhudatta Sahoo,et al.  Toward secure software-defined networks against distributed denial of service attack , 2019, The Journal of Supercomputing.

[25]  Chadi Assi,et al.  Reliability-Aware Service Function Chaining With Function Decomposition and Multipath Routing , 2020, IEEE Transactions on Network and Service Management.

[26]  Dan Feng,et al.  IntFlow: Integrating Per-Packet and Per-Flowlet Switching Strategy for Load Balancing in Datacenter Networks , 2020, IEEE Transactions on Network and Service Management.

[27]  Raouf Boutaba,et al.  Latency and energy-aware provisioning of network slices in cloud networks , 2020, Comput. Commun..

[28]  K. Blomqvist,et al.  Understanding and Fostering Collective Ideation: An Improvisation-Based Method , 2019, Knowledge Management and Organizational Learning.

[29]  Jiao Zhang,et al.  Updating Data-Center Network With Ultra-Low Latency Data Plane , 2020, IEEE Access.

[30]  Flavio Esposito,et al.  RoPE: An Architecture for Adaptive Data-Driven Routing Prediction at the Edge , 2020, IEEE Transactions on Network and Service Management.

[31]  Ashraf Tammam,et al.  Performance Analysis and Evaluation of Software Defined Networking Controllers against Denial of Service Attacks , 2020 .

[32]  Xiaocui Sun,et al.  A Survey of Pricing Aware Traffic Engineering in Cloud Computing , 2020 .

[33]  Pravati Swain,et al.  FlowDCN: Flow Scheduling in Software Defined Data Center Networks , 2019, 2019 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT).

[34]  Michele Monaci,et al.  Algorithmic approaches to the multiple knapsack assignment problem , 2020 .

[35]  Dayong Wang,et al.  Optimizing Particle Swarm Optimization to Solve Knapsack Problem , 2010, ICICA.

[36]  Yuxiang Hu,et al.  PASR: An Efficient Flow Forwarding Scheme Based on Segment Routing in Software-Defined Networking , 2020, IEEE Access.

[37]  Mohamed Elhoseny,et al.  A novel PSO algorithm for dynamic wireless sensor network multiobjective optimization problem , 2018, Trans. Emerg. Telecommun. Technol..

[38]  Guihai Chen,et al.  DC-ECN: A machine-learning based dynamic threshold control scheme for ECN marking in DCN , 2020, Comput. Commun..

[39]  Ying Loong Lee,et al.  Modeling and performance evaluation of resource allocation for LTE femtocell networks , 2015 .

[40]  Xiaojun Shi,et al.  An OpenFlow-Based Load Balancing Strategy in SDN , 2020 .

[41]  S. Sumathi,et al.  LD2FA-PSO: A novel Learning Dynamic Deterministic Finite Automata with PSO algorithm for secured energy efficient routing in Wireless Sensor Network , 2020, Ad Hoc Networks.

[42]  Kusum Deep,et al.  A Modified Binary Particle Swarm Optimization for Knapsack Problems , 2012, Appl. Math. Comput..

[43]  Khin Mi Mi Aung,et al.  SDN Controlled Local Re-routing to Reduce Congestion in Cloud Data Center , 2015, 2015 International Conference on Cloud Computing Research and Innovation (ICCCRI).

[44]  Ashish Sharma,et al.  Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem , 2020 .

[45]  Piotr Borylo,et al.  PARD: Hybrid Proactive and Reactive Method Eliminating Flow Setup Latency in SDN , 2020, Journal of Network and Systems Management.

[46]  Stefan Schmid,et al.  SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks , 2020, IEEE INFOCOM 2020 - IEEE Conference on Computer Communications.