TY - JOUR
T1 - Traffic-independent multi-path routing for high-throughput data center networks
AU - Kawano, Ryuta
AU - Yasudo, Ryota
AU - Matsutani, Hiroki
AU - Koibuchi, Michihiro
AU - Amano, Hideharu
N1 - Funding Information:
A part of this work was supported by JSPS KAKENHI Grant Number JP 20K19788.
Publisher Copyright:
Copyright © 2020 The Institute of Electronics, Information and Communication Engineers
PY - 2020/12/1
Y1 - 2020/12/1
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 koptimized 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 average-case network throughput. Experimental results by network simulation show that the proposed k-optimized path routing can improve the saturation throughput by up to 18.2% compared to the conventional k-shortest path routing. Moreover, it can reduce the computation time required for optimization to 1/2760 at a minimum compared to our previously proposed method.
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 koptimized 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 average-case network throughput. Experimental results by network simulation show that the proposed k-optimized path routing can improve the saturation throughput by up to 18.2% compared to the conventional k-shortest path routing. Moreover, it can reduce the computation time required for optimization to 1/2760 at a minimum compared to our previously proposed method.
KW - Data centers
KW - Interconnection networks
KW - Warehouse-scale computing
UR - http://www.scopus.com/inward/record.url?scp=85097875068&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85097875068&partnerID=8YFLogxK
U2 - 10.1587/transinf.2020PAP0005
DO - 10.1587/transinf.2020PAP0005
M3 - Article
AN - SCOPUS:85097875068
SN - 0916-8532
VL - E103D
SP - 2471
EP - 2479
JO - IEICE Transactions on Information and Systems
JF - IEICE Transactions on Information and Systems
IS - 12
ER -