In this paper, a new analytical model for performance analysis of output-bu
ffered Banyan networks is proposed. In this model, we consider not only the
number of packets stored in a buffer, but also the state of the buffer's H
ead of Line (HOL) packet ("new" or "blocked"). Simulations are used to veri
fy the model's accuracy. The analytical results show that the maximum throu
ghput decreases when the switch size increases, and that the throughput inc
reases as the buffer size increases. When the buffer size is large enough,
say 10, the maximum throughput is close to saturation. The maximum normaliz
ed delay increases almost linearly with the increase in buffer size.