OPS: A Fairness Link Allocation Based on SDN in Datacenter Networks

IF 1 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
T. Kao, Y. Miao, San-Yuan Wang
{"title":"OPS: A Fairness Link Allocation Based on SDN in Datacenter Networks","authors":"T. Kao, Y. Miao, San-Yuan Wang","doi":"10.1504/ijcnds.2020.10028907","DOIUrl":null,"url":null,"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.","PeriodicalId":45170,"journal":{"name":"International Journal of Communication Networks and Distributed Systems","volume":"25 1","pages":"307-332"},"PeriodicalIF":1.0000,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Communication Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijcnds.2020.10028907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

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.
OPS:数据中心网络中基于SDN的公平链路分配
目前,在数据中心网络中提出了一种冗余拓扑,在OD对之间具有多条转发路径,如胖树拓扑。为了在这种拓扑结构中实现最终的公平性(公平利用),以前的算法是基于传统的最短路径算法或等成本多路径算法(ECMP)。但是,这些算法都面临着占用SDN控制器大量资源的问题,对于链路容量配置不同的网络,可能会造成大量的公平性损失。在本文中,我们提出了输出端口选择(OPS)机制,包括模块化端口选择(MOPS)和随机端口选择(ROPS),这是提高基于胖树拓扑sdn的数据中心网络结果公平性的新方法。与静态负载平衡方法相比,我们的MOPS和ROPS可以分别减少65%和33%的公平性损失。此外,MOPSE和ROPSE结合象流检测和处理机制,可以为象流动态分配更好的转发路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.50
自引率
46.20%
发文量
57
期刊介绍: IJCNDS aims to improve the state-of-the-art of worldwide research in communication networks and distributed systems and to address the various methodologies, tools, techniques, algorithms and results. It is not limited to networking issues in telecommunications; network problems in other application domains such as biological networks, social networks, and chemical networks will also be considered. This feature helps in promoting interdisciplinary research in these areas.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信