On choosing the option of core memory allocation

Choice is analyzed of allocating $M$ areas of the core memory among $N$ message flows so as to ensure a probability, not exceeding the desired one, of losing a message for every flow. This problem is stated as that of integer optimization by a minimax performance criterion. A dedicated algorithmical method is described of search for an optimal option by using the properties of loss probabilities in queueing systems. The optimization efficiency is discussed and a case of choosing an option of memory allocation is described.