Paper Info
Title
LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies
Abstract
End-to-end network latency has become an important issue for parallel application on large-scale high performance computing (HPC) systems. It has been reported that randomly-connected inter-switch networks can lower the end-to-end network latency. The trade-off is a large amount of routing information. For irregular networks, minimal routing is achieved by using routing tables for all destinations in the network. In this work, a novel distributed routing method called LOREN (Layout-Oriented Routing with Entries for Neighbors) to achieve low-latency with a small routing table is proposed for irregular networks whose link length is limited. The routing tables contain both physically and topologically nearby neighbor nodes to ensure livelock-freedom and a small number of hops between nodes. Experimental results show that LOREN reduces the average latencies by 2.8% and improves the network throughput by up to 39% compared with a conventional compact routing method. Moreover, the required routing table size is reduced by up to 67%, which improves scalability and flexibility for implementation.
Year
DOI
Venue
2016
10.1109/CANDAR.2016.0019
2016 Fourth International Symposium on Computing and Networking (CANDAR)
Keywords
Field
DocType
High Performance Computing,Network Topology,Interconnection Networks
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Policy-based routing,Enhanced Interior Gateway Routing Protocol,Static routing,Computer science,Destination-Sequenced Distance Vector routing,Computer network,Routing table,Distributed computing
Conference
ISSN
ISBN
Citations 
2379-1888
978-1-5090-2656-2
0
PageRank 
References 
Authors
0.34
15
6
Name
Order
Citations
PageRank
Ryuta Kawano153.22
Hiroshi Nakahara232.77
Ikki Fujiwara312716.00
Hiroki Matsutani457662.07
Michihiro Koibuchi572674.68
Hideharu Amano61375210.21