Performance evaluation of the blocking windows algorithm in blocking multicast log2(N, 0, p) switching networks

Abstract

The Blocking Windows Algorithm (BWA) with the fixed-size windows was introduced by Lea in [1] and was used in nonblocking multicast banyan type switching networks. Later, Danilewicz and Kabaciński extended BWA to the variable window sizes variant in [2]. Some authors used this concept for different architectures of nonblocking multicast switching networks (Danilewicz, Hwang) [3], [4]. In this paper, performance evaluation of BWA in blocking multicast log2(N, 0, p) switching networks is presented. Different settings of BWA have an impact on a performance of the algorithm. In this paper, we investigate which parameters of BWA give better results in terms of blocking probability in blocking multicast log2(N, 0, p) switching networks.