G-network with unreliable systems with control and quarantine queues and the option of moving negative orders between systems

The object of the investigation in the article is a G-network consisting of unreliable quarantine, control and service queues in the systems (QS). After the destruction of one positive claim, negative claims can either leave the network or move between the QS of the network. It is assumed that in a certain proportion of cases, a virus can deceive antivirus software (ASW) and cause harm to a computer network. This is possible until the virus is detected by the ASW of a certain QS. Using the method of multidimensional generating functions (MDGF), the average characteristics of a given QS are found if all of its characteristics, except for the number of SLs, operate in saturation mode.