Wide-sense nonblocking multicast Log2(N,m,p) networks

Recently, Tscha and Lee proposed a fixed-size window algorithm for the multicast Log₂(N,0,p) network and expressed a desire to see its extension to the Log₂(N,m,p) network. Later, Kabacinski and Danilewicz generalized the fixed-size window to variable size to improve the results. In this paper, we further extend the variable-size results from the Log₂(N,0,p) network to Log₂(N,m,p). Note that this extension is difficult since each link in the channel graph of Log₂(N,0,p) has the same blocking effect, but not so in Log₂(N,m,p). We also determine the optimal window size and optimal m.