### Article

## Многоканальная система с одновременным обслуживанием требования несколькими приборами при постоянном времени обслуживания

This paper is focused on stability conditions of a multi-server queueing system with regenerative input flow where a random number of servers is simultaneously required for each customer and each server's completion time is constant. It turns out that the stability condition depends on the rate of the input flow and not on its structure.

We study the stability conditions of the multiserver queueing system in which each customer requires a random number of servers simultaneously. The input flow is supposed to be a regenerative one and service times of a given customer are independent at the occupied servers. The service time has an exponential, phase-type or hyper-exponential distribution. We define an auxiliary service process that is the number of completed services by all m servers under the assumption that there are always customers in the system. Then we construct the sequence of common regeneration points for the regenerative input flow and the auxiliary service process. It allows us to deduce the stability criterion of the model under consideration. It turns out that the stability condition does not depend on the structure of the input flow, only the rate of this process plays a role. Nevertheless the distribution of the service time is a very important factor. We give examples which show that the stability condition can not be expressed in terms of the mean of the service time.

We study the stability conditions of the multiserver system in which each customer requires a random number of servers simultaneously. The input flow is supposed to be a regenerative one and a random service time is identical at all occupied servers. The service time has an exponential or a phase-type distribution. We define an auxiliary service process that is the number of served customers under assumption that always there are customers at the system. Then we construct the sequence of common regeneration points for the regenerative input flow and the auxiliary service process. Basing on relation between the real and auxiliary service processes we obtain the upper and lower estimates for the mean of the really served customers during the common regeneration period. It allows us to deduce the stability criterion of the model under consideration. It turns out that the stability condition does not depend on the structure of the input flow, only the rate of this process plays a role. Nevertheless the distribution of the service time is a very important factor. We give an example which shows that the stability condition can not be expressed in terms of the mean of the service time.

Abstracts of the 9-th International Workshop on Applied Probability

We construct the optimal strategy for management system with variable structure, which is described by a controlled semi-Markov process with a finite set of states. An algorithm for solving the problem and the results of numerical experiments

We study stability conditions of the multiserver queueing system in which each customer requires a random number of servers simultaneously. The input flow is supposed to be a regenerative one. We consider two models: the system where service time is the same on all occupied servers and equals a constant b and the system where service times are independent on all occupied servers and have exponential distribution. Discipline is FIFO. We define an auxiliary queueing system $S_0$ in which there are always customers in the queue and define an auxiliary service process $Z(t)$ as the number of completed services by all $m$ servers during the time interval $(0,t)$ in this system. Then we construct the sequence of common regeneration points for the regenerative input flow and the auxiliary service process. It allows us to deduce the stability condition of the model under consideration. It turns out that the stability condition does not depend on the structure of the input flow, only the rate of this process plays a role.

Existence and uniqueness has been established for a mean-field version of the GI/GI/1 queueing model

ASMDA 2017

The Volume includes a Special Section on "Analytical and Computational Methods in Probability"

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.

Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.

Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.