Recently, a new routing algorithm called inside-out routing algorithm
was proposed for routing an arbitrary permutation in the omega-based 2
log(2) N stage networks. This paper discusses the problems of the insi
de-out routing algorithm and shows that the suggested condition for pr
oper routing in the omega-omega network is insufficient. An extended n
ecessary and sufficient condition for proper routing in the omega-omeg
a network is also suggested. However, it is unknown if any permutation
can be successfully routed by a heuristic algorithm which follows the
condition. Thus, the rearrangeability of the omega-omega network stil
l remains an open problem.