Abstract
In this paper, we study the problem of data flow management in the presence of heterogeneous flows — elephant and mice flowsThe data flow is divided into two categories based on the associated data-rateTrestian2017. The flows with high data-rate are termed as elephant flows, while those with low data-rate are termed as mice flows. in software-defined networks (SDNs). The researchers did not consider the presence of heterogeneous flows in SDN in the existing literature. Moreover, we argue that 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 show 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.
Funding Information
  • SERB/IMPRINT-II (SERB/F/12680/2018-2019, IMP/2018/000451)

This publication has 28 references indexed in Scilit: