K-Optimized Path Routing for High-Throughput Data Center Networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been reported that randomly-connected inter-switch networks can enlarge the network throughput. For irregular networks, a multi-path routing method called k-shortest path routing is conventionally utilized. However, it cannot efficiently exploit longer-than-shortest paths that would be detour paths to avoid bottlenecks. In this work, a novel routing method called k-optimized path routing to achieve high throughput is proposed for irregular networks. We introduce a heuristic to select detour paths that can avoid bottlenecks in the network to improve the network throughput. Experimental results show that the proposed k-optimized path routing can improve the throughput by up to 133 % compared to the conventional k-shortest path routing. Moreover, it can improve the network bandwidth while maintaining the low network latency.

Original languageEnglish
Title of host publicationProceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages99-105
Number of pages7
ISBN (Electronic)9781538691823
DOIs
Publication statusPublished - 2018 Dec 27
Event6th International Symposium on Computing and Networking, CANDAR 2018 - Takayama, Japan
Duration: 2018 Nov 272018 Nov 30

Publication series

NameProceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018

Conference

Conference6th International Symposium on Computing and Networking, CANDAR 2018
CountryJapan
CityTakayama
Period18/11/2718/11/30

Fingerprint

Throughput
Warehouses
Switches
Bandwidth

Keywords

  • Data Centers
  • Interconnection Networks
  • Warehouse-Scale Computing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Kawano, R., Yasudo, R., Matsutani, H., & Amano, H. (2018). K-Optimized Path Routing for High-Throughput Data Center Networks. In Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018 (pp. 99-105). [8594749] (Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CANDAR.2018.00020

K-Optimized Path Routing for High-Throughput Data Center Networks. / Kawano, Ryuta; Yasudo, Ryota; Matsutani, Hiroki; Amano, Hideharu.

Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 99-105 8594749 (Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kawano, R, Yasudo, R, Matsutani, H & Amano, H 2018, K-Optimized Path Routing for High-Throughput Data Center Networks. in Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018., 8594749, Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018, Institute of Electrical and Electronics Engineers Inc., pp. 99-105, 6th International Symposium on Computing and Networking, CANDAR 2018, Takayama, Japan, 18/11/27. https://doi.org/10.1109/CANDAR.2018.00020
Kawano R, Yasudo R, Matsutani H, Amano H. K-Optimized Path Routing for High-Throughput Data Center Networks. In Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 99-105. 8594749. (Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018). https://doi.org/10.1109/CANDAR.2018.00020
Kawano, Ryuta ; Yasudo, Ryota ; Matsutani, Hiroki ; Amano, Hideharu. / K-Optimized Path Routing for High-Throughput Data Center Networks. Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 99-105 (Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018).
@inproceedings{0bbef3b7398e45d3abb20fe44ff204f4,
title = "K-Optimized Path Routing for High-Throughput Data Center Networks",
abstract = "Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been reported that randomly-connected inter-switch networks can enlarge the network throughput. For irregular networks, a multi-path routing method called k-shortest path routing is conventionally utilized. However, it cannot efficiently exploit longer-than-shortest paths that would be detour paths to avoid bottlenecks. In this work, a novel routing method called k-optimized path routing to achieve high throughput is proposed for irregular networks. We introduce a heuristic to select detour paths that can avoid bottlenecks in the network to improve the network throughput. Experimental results show that the proposed k-optimized path routing can improve the throughput by up to 133 {\%} compared to the conventional k-shortest path routing. Moreover, it can improve the network bandwidth while maintaining the low network latency.",
keywords = "Data Centers, Interconnection Networks, Warehouse-Scale Computing",
author = "Ryuta Kawano and Ryota Yasudo and Hiroki Matsutani and Hideharu Amano",
year = "2018",
month = "12",
day = "27",
doi = "10.1109/CANDAR.2018.00020",
language = "English",
series = "Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "99--105",
booktitle = "Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018",

}

TY - GEN

T1 - K-Optimized Path Routing for High-Throughput Data Center Networks

AU - Kawano, Ryuta

AU - Yasudo, Ryota

AU - Matsutani, Hiroki

AU - Amano, Hideharu

PY - 2018/12/27

Y1 - 2018/12/27

N2 - Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been reported that randomly-connected inter-switch networks can enlarge the network throughput. For irregular networks, a multi-path routing method called k-shortest path routing is conventionally utilized. However, it cannot efficiently exploit longer-than-shortest paths that would be detour paths to avoid bottlenecks. In this work, a novel routing method called k-optimized path routing to achieve high throughput is proposed for irregular networks. We introduce a heuristic to select detour paths that can avoid bottlenecks in the network to improve the network throughput. Experimental results show that the proposed k-optimized path routing can improve the throughput by up to 133 % compared to the conventional k-shortest path routing. Moreover, it can improve the network bandwidth while maintaining the low network latency.

AB - Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been reported that randomly-connected inter-switch networks can enlarge the network throughput. For irregular networks, a multi-path routing method called k-shortest path routing is conventionally utilized. However, it cannot efficiently exploit longer-than-shortest paths that would be detour paths to avoid bottlenecks. In this work, a novel routing method called k-optimized path routing to achieve high throughput is proposed for irregular networks. We introduce a heuristic to select detour paths that can avoid bottlenecks in the network to improve the network throughput. Experimental results show that the proposed k-optimized path routing can improve the throughput by up to 133 % compared to the conventional k-shortest path routing. Moreover, it can improve the network bandwidth while maintaining the low network latency.

KW - Data Centers

KW - Interconnection Networks

KW - Warehouse-Scale Computing

UR - http://www.scopus.com/inward/record.url?scp=85061478065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85061478065&partnerID=8YFLogxK

U2 - 10.1109/CANDAR.2018.00020

DO - 10.1109/CANDAR.2018.00020

M3 - Conference contribution

AN - SCOPUS:85061478065

T3 - Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018

SP - 99

EP - 105

BT - Proceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -