Optimization of buffer memory size of switching node in mode of full memory sharing

The problem of optimizing the volume of the buffer memory of the network switching node with the CP (Complete Partitioning) is considered, which uses a scheme for the complete memory sharing between the output transmission lines, taking into account packet loss due to memory overflow and average packet delays. The properties of the solution of the problem are obtained, and an algorithm for searching for the optimal volume is developed for the switching node model with Poisson incoming flows, common service time distributions, and single-channel output transmission lines. Within the given model, an algorithm for finding the optimal buffer memory allocation plan for a given volume is developed. The results of computational experiments using the developed algorithms are presented. The applicability of the proposed algorithms and approaches is obtained in the framework of the switching node model with recurrent incoming flows, exponential service times, and single-channel transmission lines.