OPS: a fairness link allocation based on SDN in datacentre networks
by Tain-Lieng Kao; Yan Ting Miao; San-Yuan Wang
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 25, No. 3, 2020

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.

Online publication date: Tue, 15-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com