Two heuristic node placement algorithms, DIST and SPARSE, have been proposed for Shuffle-Like Networks (SL-Nets). Since a route between two nodes is assumed to be given, the algorithms have the problem that traffic amounts over some links may be too large. In this report, we propose two new node placement algorithms, New_DIST and New_SPARSE, in which routes are assumed to be design variables. New_DIST (New_SPARSE) places nodes in the same way as DIST (SPARSE), and selects such a shortest path between two nodes that traffic amounts of links are balanced. Numerical examples for four typical traffic matrices show that the better performance can be obtained by using one of the proposed algorithms for each matrix.
