Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks
碩士 === 國立中興大學 === 資訊科學與工程學系所 === 107 === Multi-rooted tree topology provides multiple parallel paths between host pairs. Therefore, it is very suitable as a network topology of a data center that needs to support cloud parallel computing. The routing method used by traditional data centers emphasize...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5394083%22.&searchmode=basic |
id |
ndltd-TW-107NCHU5394083 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-107NCHU53940832019-11-30T06:09:40Z http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5394083%22.&searchmode=basic Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks 在胖樹拓樸結構中的能源感知流量分配演算法 Sung-Hsi Tsai 蔡松熹 碩士 國立中興大學 資訊科學與工程學系所 107 Multi-rooted tree topology provides multiple parallel paths between host pairs. Therefore, it is very suitable as a network topology of a data center that needs to support cloud parallel computing. The routing method used by traditional data centers emphasizes the ability to make full use of bandwidth. For example, equal-cost multi-path routing(ECMP) splits traffic onto many equivalent paths for transmission to improve bandwidth usage. However, ECMP may cause unnecessary waste of electricity. Therefore, we propose an energy-aware path allocation mechanism under the software-defined network(SDN) architecture. SDN separates the control layer from the traditional network, and the controller centrally manages the path allocation of each flow. In our mechanism, the controller needs to detect the flow at the switches and establish a candidate path set for each new flow. After considering the overall network topology, assigning paths will minimize power consumption to new flow and turn off unused switches to reduce network power consumption. Each time new traffic is added, the port with the least power consumption is selected by the greedy energy-saving heuristic algorithm. However, the order in which each flow is added to the network affects the results of the heuristic algorithm. Therefore, we use the genetic algorithm to reroute the long-lived traffic in the network in a fixed cycle. At the end of the paper, we compare our method with the common routing strategy ECMP and greedy energy-saving heuristic. The experimental data shows that our method can reduce power consumption by 30%. Compared to greedy energy-saving algorithms that also have energy-awareness, our approach has about 7% of better power consumption reduction. Shang-Juh Kao 高勝助 2019 學位論文 ; thesis 26 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中興大學 === 資訊科學與工程學系所 === 107 === Multi-rooted tree topology provides multiple parallel paths between host pairs. Therefore, it is very suitable as a network topology of a data center that needs to support cloud parallel computing. The routing method used by traditional data centers emphasizes the ability to make full use of bandwidth. For example, equal-cost multi-path routing(ECMP) splits traffic onto many equivalent paths for transmission to improve bandwidth usage. However, ECMP may cause unnecessary waste of electricity. Therefore, we propose an energy-aware path allocation mechanism under the software-defined network(SDN) architecture. SDN separates the control layer from the traditional network, and the controller centrally manages the path allocation of each flow. In our mechanism, the controller needs to detect the flow at the switches and establish a candidate path set for each new flow. After considering the overall network topology, assigning paths will minimize power consumption to new flow and turn off unused switches to reduce network power consumption.
Each time new traffic is added, the port with the least power consumption is selected by the greedy energy-saving heuristic algorithm. However, the order in which each flow is added to the network affects the results of the heuristic algorithm. Therefore, we use the genetic algorithm to reroute the long-lived traffic in the network in a fixed cycle. At the end of the paper, we compare our method with the common routing strategy ECMP and greedy energy-saving heuristic. The experimental data shows that our method can reduce power consumption by 30%. Compared to greedy energy-saving algorithms that also have energy-awareness, our approach has about 7% of better power consumption reduction.
|
author2 |
Shang-Juh Kao |
author_facet |
Shang-Juh Kao Sung-Hsi Tsai 蔡松熹 |
author |
Sung-Hsi Tsai 蔡松熹 |
spellingShingle |
Sung-Hsi Tsai 蔡松熹 Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks |
author_sort |
Sung-Hsi Tsai |
title |
Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks |
title_short |
Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks |
title_full |
Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks |
title_fullStr |
Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks |
title_full_unstemmed |
Energy Aware Flow Allocation Algorithm forFat-tree Data Center Networks |
title_sort |
energy aware flow allocation algorithm forfat-tree data center networks |
publishDate |
2019 |
url |
http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5394083%22.&searchmode=basic |
work_keys_str_mv |
AT sunghsitsai energyawareflowallocationalgorithmforfattreedatacenternetworks AT càisōngxī energyawareflowallocationalgorithmforfattreedatacenternetworks AT sunghsitsai zàipàngshùtàpǔjiégòuzhōngdenéngyuángǎnzhīliúliàngfēnpèiyǎnsuànfǎ AT càisōngxī zàipàngshùtàpǔjiégòuzhōngdenéngyuángǎnzhīliúliàngfēnpèiyǎnsuànfǎ |
_version_ |
1719300480895549440 |