Open Access Open Access  Restricted Access Subscription Access

Optimizing Elephant Flow Scheduling for SDN-Based Data Center Network

Zehui Liu,
Deyun Gao,
Ying Liu,
Hongke Zhang,
Han-Chieh Chao,

Abstract


Software Defined Network (SDN) is able to provide better network management and higher utilization for data center. However the centralized control of entire network may trigger large overhead and limit the scalability of control plane. In this paper, we propose an enhanced mechanism of elephant flow scheduling in SDN-based data center. The mechanism can efficiently reduce the overhead and improve the scalability of control plane by using Parametric Minimum Cross Entropy (PMCE) algorithm. We describe the proposed approach in detail, and evaluate it in OMnet++ to verity its feasibility and effectiveness. Numerical results show that the benefits of the scheme are better than previous methods and the extra delay caused by PMCE algorithm is controllable.

Keywords


SDN; Data center; Elephant flow scheduling; PMCE algorithm

Citation Format:
Zehui Liu, Deyun Gao, Ying Liu, Hongke Zhang, Han-Chieh Chao, "Optimizing Elephant Flow Scheduling for SDN-Based Data Center Network," Journal of Internet Technology, vol. 18, no. 1 , pp. 1-9, Jan. 2017.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.





Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Library and Information Center, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd. Shoufeng, Hualien 97401, Taiwan, R.O.C.
Tel: +886-3-931-7017  E-mail: jit.editorial@gmail.com