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.

The apparatus of Generalized Nets is applied here to describe a PIM-algorithm for computing a non-conflict schedule for packet switch node. In the present paper we propose a family of patterns for nonuniform traffic simulation based on the hotspot traffic model. The results from computer simulations of the throughput on a switch node with these patterns are presented. The necessary computations have been performed on grid-clusters of CERN. Our simulations utilize the PIM-algorithm, specified by apparatus of Generalized Nets. It is shown that there is an upper bound on the throughput of PIM-algorithm for proposed family of patterns.