Computering Simulation of Schedule Algorithm for High Performance Packet Switch Node Modelled by the Apparatus of Generalized Nets

摘要

The aim of the paper is a check of the capability of Generalized nets (GN)apparatus for modelling of parallel processes in packet switch node. By means of Generalized nets is synthesised a model of PIM (Parallel Iterative Matching) algorithm for computing of non-conflict schedule in crossbar switch node. The results of computer simulation of a GN-model pen'orming uniform load traffic are presented. It is shown that so obtained by the simulation evaluation for throughput of switch mode tend near the theoretical boundary. A simple model for uniform traffic is suggested for switch throughput calculating which is capable to estimate approximately but faster at a rate depending on the rank of switch.