Modeling of interruptions in computer network on control of non-zero minimum of capacity

Abstract

Processor sharing disciplines in the queueing theory can provide a basis for a modelling and analysis of interruptions in a telecommunications and computer network systems, internet network systems in particular, with control of non-zero minimum of capacity. Such service options can be used in systems with increased network load, in case of DDOS attacks, when storing data package in a buffer can lead to its overflow and system failure. We describe a version of the processor sharing discipline called the limited processor sharing. We describe reasons to use version of the limited processor sharing system without buffer for waiting jobs with multiprogramming level (MPL) setting. We describe results obtained for queueing systems with related versions of processor sharing discipline. We formulate theorems and give formulas for specific cases.To simulate the operation of such systems and obtain their characteristics, we have developed the MoQuST (Module for Queueing System Testing) software.