OPS: a fairness link allocation based on SDN in datacentre networks. (5th May 2020)

• Record Type: Journal Article
• Authors: Kao, Tain-Lieng; Miao, Yan Ting; Wang, San-Yuan
• Is Part Of: International journal of communication networks and distributed systems. Volume 25:Number 3(2021)
• Page Start: 307
• Page End: 332
• Publication Date: 2020-05-05
• Subjects: software defined networking -- SDN -- datacentre network -- fat-tree topology -- fairness -- elephant flow -- OpenFlow; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• Languages: English
• ISSNs: 1754-3916

Abstract

Nowadays, redundant topologies with multiple forwarding paths between original-destination (OD) pairs have been proposed for datacentre networks, such as fat-tree topology. To achieve resultant fairness (fair utilisation) in this topology, previous algorithms were based on traditional shortest path algorithms or equal-cost multiple paths algorithms (ECMP). However, these algorithms are facing with take up a lot of resources of the SDN controller and may cause a large amount of loss of resultant fairness for the network that has different configurations of link capacity. In this paper, we present out port selection (OPS) mechanisms, including modular out port selection (MOPS) and random out port selection (ROPS), novel methods to improve resultant fairness of fat-tree topology SDN-based datacentre network. Compare with static load-balance methods, our MOPS and ROPS can reduce 65% and 33% loss of fairness, respectively. Further, combining with elephant flows detecting and handling mechanisms, MOPSE and ROPSE can dynamically assign better forwarding path for elephant flows.