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

Ryuta Kawano, Ryota Yasudo, Hiroki Matsutani, Hideharu Amano

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - 2018 6th International Symposium on Computing and Networking, CANDAR 2018
出版社Institute of Electrical and Electronics Engineers Inc.
ページ99-105
ページ数7
ISBN(電子版)9781538691823
DOI
出版ステータスPublished - 2018 12月 27
イベント6th International Symposium on Computing and Networking, CANDAR 2018 - Takayama, Japan
継続期間: 2018 11月 272018 11月 30

出版物シリーズ

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

Conference

Conference6th International Symposium on Computing and Networking, CANDAR 2018
国/地域Japan
CityTakayama
Period18/11/2718/11/30

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信
  • ソフトウェア
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「K-Optimized Path Routing for High-Throughput Data Center Networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル