FlowMan: QoS-Aware Dynamic Data Flow Management in Software-Defined Networks

被引:12
作者
Mondal, Ayan [1 ]
Misra, Sudip [1 ]
机构
[1] IIT Kharagpur, Dept Comp Sci & Engn, Kharagpur 721302, W Bengal, India
关键词
Switches; Delays; Throughput; Quality of service; Mice; Artificial neural networks; Load balancing; software-defined networks; Nash bargaining game; IoT; heterogeneous flow; ALGORITHM;
D O I
10.1109/JSAC.2020.2999682
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we study the problem of data flow management in the presence of heterogeneous flows - elephant and mice flows - in software-defined networks (SDNs). Most of the researchers considered the homogeneous flows in SDN in the existing literature. The optimal data flow management in the presence of heterogeneous flows is NP-hard. Hence, we propose a game theory-based heterogeneous data flow management scheme, named FlowMan. In FlowMan, initially, we use a generalized Nash bargaining game to obtain a sub-optimal problem, which is NP-complete in nature. By solving it, we get the Pareto optimal solution for data-rate associated with each switch. Thereafter, we use a heuristic method to decide the flow-association with the switches, distributedly, which, in turn, helps to get a Pareto optimal solution. Extensive simulation results depict that FlowMan is capable of ensuring quality-of-service (QoS) for data flow management in the presence of heterogeneous flows. In particular, FlowMan is capable of reducing network delay by 77.8-98.7%, while ensuring 24.6-47.8% increase in network throughput, compared to the existing schemes such as FlowStat and CURE. Additionally, FlowMan ensures that per-flow delay is reduced by 27.7% with balanced load distribution among the SDN switches.
引用
收藏
页码:1366 / 1373
页数:8
相关论文
共 30 条
[1]  
Agarwal S., 2013, P IEEE INFOCOM, P1
[2]   Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks [J].
Allybokus, Zaid ;
Avrachenkov, Konstantin ;
Leguay, Jeremie ;
Maggi, Lorenzo .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (12) :2655-2666
[3]  
[Anonymous], 2014, OPENFLOW SWITCH SPEC
[4]   FlowStat: Adaptive Flow-Rule Placement for Per-Flow Statistics in SDN [J].
Bera, Samaresh ;
Misra, Sudip ;
Jamalipour, Abbas .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2019, 37 (03) :530-539
[5]   Simultaneously Reducing Latency and Power Consumption in OpenFlow Switches [J].
Congdon, Paul T. ;
Mohapatra, Prasant ;
Farrens, Matthew ;
Akella, Venkatesh .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (03) :1007-1020
[6]   A SIMULATED ANNEALING APPROACH TO THE MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEM [J].
DREXL, A .
COMPUTING, 1988, 40 (01) :1-8
[7]  
Federal Communications Commission (FCC), 2019, BROADB SPEED GUID
[8]   Dynamic Control Plane for SDN at Scale [J].
Gorkemli, Burak ;
Tatlicioglu, Sinan ;
Tekalp, A. Murat ;
Civanlar, Seyhan ;
Lokman, Erhan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (12) :2688-2701
[9]   Scalable Architecture for SDN Traffic Classification [J].
Hayes, Matthew ;
Ng, Bryan ;
Pekar, Adrian ;
Seah, Winston K. G. .
IEEE SYSTEMS JOURNAL, 2018, 12 (04) :3203-3214
[10]   Joint Optimization of Rule Placement and Traffic Engineering for QoS Provisioning in Software Defined Network [J].
Huang, Huawei ;
Guo, Song ;
Li, Peng ;
Ye, Baoliu ;
Stojmenovic, Ivan .
IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (12) :3488-3499