Repackable multi-Log2N networks

Repackable Log2(N, m, p) Networks and Wide-Sense Nonblocking Log2(8, 0, p) Networks

“…The approach adopted in our work, which focuses on Log 2 (N , m, p) networks, differs considerably from those proposed in [12−17], which were based on Clos or Benes networks. Repackable Log 2 (N , 0, p) networks were first studied in [10]. In the present paper, we extend the results on repackable Log 2 (N , 0, p) networks to Log 2 (N , m, p) networks by adopting a channel graph blockage analysis first employed by Shyy and Lea [2].…”

“…Proof. This property is true for BY(n, 0) networks [10]. Hence, we consider only BY(n, 1) networks in this proof.…”