SOPA:Source Routing Based Packet-Level Multi-Path Routing in Data Center Networks  

SOPA: Source Routing Based Packet-Level Multi-Path Routing in Data Center Networks

在线阅读下载全文

作  者:LI Dan LIN Du JIANG Changlin Wang Lingqiang LI Dan;LIN Du;JIANG Changlin;Wang Lingqiang(Departnlent of Conlputer Science and Technology,Tsinghua University Beijing 100084,China;Pre-Researeh & Standard Departnlent,Wireline R&D Institute,ZTE Corporation,Beijing 100084,China)

机构地区:[1]Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China [2]Pre⁃Research&Standard Department,Wireline R&D Institute,ZTE Corporation,Beijing 100084,China

出  处:《ZTE Communications》2018年第2期42-54,共13页中兴通讯技术(英文版)

基  金:supported by the National Basic Research Program of China(973 program)under Grant No.2014CB347800 and No.2012CB315803;the National High-Tech R&D Program of China(863 program)under Grant No.2013AA013303;the Natural Science Foundation of China under Grant No.61170291,No.61133006,and No.61161140454;ZTE IndustryAcademia-Research Cooperation Funds

摘  要:Many "rich - connected" topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl'ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying (RPS), Hedera and equal-cost multi-path routing (ECMP), our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.Many "rich - connected" topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl'ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying (RPS), Hedera and equal-cost multi-path routing (ECMP), our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.

关 键 词:data center networks multi-path routing path splitting 

分 类 号:TP308[自动化与计算机技术—计算机系统结构] TP393.0[自动化与计算机技术—计算机科学与技术]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象