Performance analysis and design of Banyan network based broadband packet switches for integrated traffic

Approximate Markov chain models are developed for Banyan-network-based packet switches built with arbitrary node sizes and a single buffer at each of the inputs/outputs of the nodes, in a multiclass traffic environment with priority. Invariance of the total throughput and the average time delay is observed. Dilated Banyan networks are also modeled. Techniques for obtaining the time delay distributions for packets of each traffic class are illustrated. It was observed that the total throughput and the average time delay of all the packets depend only on the total load and not on the traffic mix. The first stage is found to affect the division of throughputs, while the remaining stages merely affect the time delays of the different traffic classes. Dilations provide improvements under certain assumptions.<>