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.
T2 - 6th International Symposium on Computing and Networking, CANDAR 2018
Y2 - 27 November 2018 through 30 November 2018
ER -