A Numerical Approach to the Repairman Problem with Two Different Types of Machine

In this paper we deal with a heterogeneous machine-interference model under the assumption that the priority machines have pre-emptive priority over the ordinary ones. In each group, machines are characterized by exponentially distributed failure and repair times with different rates. The failed machines are served by a single repairman according to FIFO discipline. The aim of the paper is to give the steady-state operational characteristics of the system, such as operative utilization, expected busy-period length, machine availability, mean waiting times and average number of failed machines. Finally, numerical examples illustrate the problem in question.     

The 〈G<Emphasis Type="Italic">/M/r/</Emphasis>FIFO〉 Machine-Interference Model with State-Dependent Speeds

This article treats a version of the multiple machine-interference problem with r operatives under FIFO repair discipline. The running times of machine i are supposed to be identically and arbitrarily distributed random variables with density function f _i (x), i = 1,…, n. The repair times of all machines are assumed to be identically and exponentially distributed random variables with mean 1/μ. The paper provides the main steady-state operational characteristics of the system when the running and repair speeds are dependent on the number of machines in working order.     

A simulation tool to evaluate the performance of finite-source queueing models

This paper deals with a software tool to evaluate the main characteristics of a nonhomogeneous finite-source queueing model to describe the performance of a multi-terminal system subject to random breakdowns under FIFO, priority processor sharing, and polling service disciplines. The model studied here is actually a closed queueing network network with three nonindependent service stations (CPU, terminals, and repairman), and a finite number of customers (jobs), which have different service rates at the service stations. The aim of this paper is to introduce the FQM (finite-source queueing model) program package, which was developed at the Institute of Mathematics and Informatics of Lajos Kossuth University in Debrecen, Hungary, and to investigate the performance of the above-mentioned finite-source queueing models. At the end we give a sample result to illustrate the problem in question. Supported by the Hungarian National Foundation for Scientific Research (grant Nos. OTKA T014974/95 and T016933/95). Proceedings of the Seminar on Stability Problems for Stochastic Models, Vologda, Russia, 1998, Part I.     

Using Infinite-server Resource Queue with Splitting of Requests for Modeling Two-channel Data Transmission

New Radio Access Technology 3GPP New Radio has become the fundamental wireless technology in the fifth-generation networks, which allows us to achieve high data rates due to the ability to work in the millimeter-wave band. But the key feature and the main problem of 5G New Radio networks is that people themselves, cars, buildings, etc. are signal blockers, while the base stations of the fourth generation networks have widescreen broadcasting and such small obstacles do not cause loss of connection. Service providers and mobile operators are already testing the proposed technology. In this connection, the scientific community has the task of analyzing the performance of these systems and increasing it in the future. Currently, there are known studies of “basic” mathematical models of such networks. By this term, we mean models built in the simplest possible assumptions. However, due to the justified necessity of introducing new technology into the daily lives of subscribers, service providers pose the scientific community with the task of analyzing the effectiveness of the most appropriate mathematical models. For example, a technology of splitting transmitted data into two streams using as 5G and both 4G transmission technologies is considered now by 3GPP Project Coordination Group. The paper is devoted to such a problem. We consider a mathematical model of the message transmitting with the implementation of the splitting function in the communication networks of New Radio technology in the form of a resource queueing system with a renewal arrival process and non-exponential service. For this problem, an approximation of a stationary two-dimensional probability distribution of the number of occupied resources in parallel service units is obtained. It is shown that this approximation coincides with the Gaussian distribution, and its area of applicability is shown.