Computer Sciences

An Analysis Method of Open Queueing Networks with a Degradable Structure and Instantaneous Repair Times of Systems

Authors: Tananko I. E., Fokina N. P.

An unreliable open queueing network with Poisson arrivals is considered. For each queueing system the service and failures times are exponentially distributed random variables. The failures of systems lead to changes in the structure of the network and corresponding changes in the performance measures of the queueing network. It is assumed that the times between changes in the network structure are sufficient for the steady-state regime. The main measure of the quality for the network at each structure constancy interval is the average response time.

Markov Chain States Classification in a Tandem Model with a Cyclic Service Algorithm with Prolongation

Authors: Kocheganov V. M.

There is a limited list of papers about crossroads tandems. Usually the following service algorithms are under consideration: a cyclic algorithm with fixed duration, a cyclic algorithm with a loop a cyclic algorithm with regime changes etc. To construct a formal mathematical model of queuing systems nets and crossroads tandems in particular a descriptive approach is usually used. Using this approach input flows and service algorithms are set at the level of content, service duration distribution is known and set via a particular customer service distribution function.

Survival Rate of Model Populations Depending on the Strategy of Energy Exchange Between the Organisms

Authors: Ivanko E. E., Chervinsky S. M.

The paper addresses the influence of the energy exchange strategy between the organisms of a population in a gradually changing environment on the survival rate of this population. At the first stage of computational experiments, a “boundary” region is determined in the space of two parameters (mutation rate and energy supply rate), within which the survival of populations with zero energy exchange is ambiguous (lies in the interval from 5 to 95%).