Modeling of the MiMa-algorithm for crossbar switch by means of Generalized Nets

The Generalized Nets apparatus is applied here to describe the MiMa-algorithm for computing a conflict-free schedule for packet switch. In the paper we propose a family of patterns for nonuniform traffic simulation. The results for throughput on a switch node with MiMa-algorithm by computer simulations with these patterns are presented. The necessary computations have been executed on BG01-IPP grid-cluster (www.grid.bas.bg) of the Institute of information and communication technology (IICT-BAS). It is shown that the upper bound on the throughput of MiMa-algorithm is committed to 100% (maximal throughput) for the proposed family of patterns.