A complex multi-state k-out-of-n: G system with preventive maintenance and loss of units

In this study, a multi-state k-out-of-n: G system subject to multiple events is modeled through a Markovian Arrival Process with marked arrivals. The system is composed initially of n units and is active when at least k units are operational. Each unit is multi-state, each of which is classified as minor or major according to the level of degradation presented. Each operational unit may undergo internal repairable or non-repairable failures, external shocks and/or random inspections. An external shock can provoke extreme failure, while cumulative external damage can deteriorate internal performance. This situation can produce repairable and non-repairable failures. When a repairable failure occurs the unit is sent to a repair facility for corrective repair. If the failure is non-repairable, the unit is removed. When the system has insufficient units with which to operate, it is restarted. Preventive maintenance is employed in response to random inspection. The system is modeled in an algorithmic and computational form. Several interesting measures of performance are considered. Costs and rewards are included in the system. All measures are obtained for transient and stationary regimes. A numerical example is analyzed to determine whether preventive maintenance is profitable, financially and in terms of performance.Junta de Andalucía (Spain) FQM-307Ministerio de Economía y Competitividad (España) MTM2017-88708-PEuropean Regional Development Fund (ERDF

A discrete MMAP for analysing the behaviour of a multi-state complex dynamic system subject to multiple events.

A complex multi-state system subject to different types of failures, repairable and/or nonrepairable, external shocks and preventive maintenance is modelled by considering a discrete Markovian arrival process with marked arrivals (D-MMAP). The internal performance of the system is composed of several degradation states partitioned into minor and major damage states according to the risk of failure. Random external events can produce failures throughout the system. If an external shock occurs, there may be an aggravation of the internal degradation, cumulative external damage or extreme external failure. The internal performance and the cumulative external damage are observed by random inspection. If major degradation is observed, the unit goes to the repair facility for preventive maintenance. If a repairable failure occurs then the system goes to corrective repair with different time distributions depending on the failure state. Time distributions for corrective repair and preventive maintenance depend on the failure state. Rewards and costs depending on the state at which the device failed or was inspected are introduced. The system is modelled and several measures of interest are built into transient and stationary regimes. A preventive maintenance policy is shown to determine the effectiveness of preventive maintenance and the optimum state of internal and cumulative external damage at which preventive maintenance should be taken into account. A numerical example is presented, revealing the efficacy of the model. Correlations between the numbers of different events over time and in non-overlapping intervals are calculated. The results are expressed in algorithmic-matrix form and are implemented computationally with Matlab.Junta de Andalucía, Spain, under the grant FQM307Ministerio de Economía y Competitividad, España, MTM2017-88708-PEuropean Regional Development Fund (ERDF

Markovian arrivals in stochastic modelling: a survey and some new results

This paper aims to provide a comprehensive review on Markovian arrival processes (MAPs), which constitute a rich class of point processes used extensively in stochastic modelling. Our starting point is the versatile process introduced by Neuts (1979) which, under some simplified notation, was coined as the batch Markovian arrival process (BMAP). On the one hand, a general point process can be approximated by appropriate MAPs and, on the other hand, the MAPs provide a versatile, yet tractable option for modelling a bursty flow by preserving the Markovian formalism. While a number of well-known arrival processes are subsumed under a BMAP as special cases, the literature also shows generalizations to model arrival streams with marks, nonhomogeneous settings or even spatial arrivals. We survey on the main aspects of the BMAP, discuss on some of its variants and generalizations, and give a few new results in the context of a recent state-dependent extension.Peer Reviewe

A complex multi-state system with vacations in the repair

A complex multi-state system subject to wear failure and given preventive maintenance is considered. Various internal levels of degradation are assumed. The repair facility is composed of a repairperson, who may take one or more vacations during the period considered. A policy is established for the repairperson’s vacation time. Two types of task may be performed by the repairperson: corrective repair and preventive maintenance. All embedded times in the system are phase type distributed. The transient and stationary distributions are determined and several reliability measures are developed in a matrix-algorithmic form. Costs and rewards are included in the model. The results are implemented computationally with Matlab. A numerical example shows that the distribution of vacation time can be optimised according to the net reward established.Junta de Andalucía, Spain, FQM-307Ministerio de Economía y Competitividad, España, under Grant MTM2017−88708−PEuropean Regional Development Fund (ERDF

Optimizing a Multi-State Cold-Standby System with Multiple Vacations in the Repair and Loss of Units

A complex multi-state redundant system with preventive maintenance subject to multiple events is considered. The online unit can undergo several types of failure: both internal and those provoked by external shocks. Multiple degradation levels are assumed as both internal and external. Degradation levels are observed by random inspections and, if they are major, the unit goes to a repair facility where preventive maintenance is carried out. This repair facility is composed of a single repairperson governed by a multiple vacation policy. This policy is set up according to the operational number of units. Two types of task can be performed by the repairperson, corrective repair and preventive maintenance. The times embedded in the system are phase type distributed and the model is built by using Markovian Arrival Processes with marked arrivals. Multiple performance measures besides the transient and stationary distribution are worked out through matrix-analytic methods. This methodology enables us to express the main results and the global development in a matrix-algorithmic form. To optimize the model, costs and rewards are included. A numerical example shows the versatility of the model

Numerical methods for queues with shared service

A queueing system is a mathematical abstraction of a situation where elements, called customers, arrive in a system and wait until they receive some kind of service. Queueing systems are omnipresent in real life. Prime examples include people waiting at a counter to be served, airplanes waiting to take off, traffic jams during rush hour etc. Queueing theory is the mathematical study of queueing phenomena. As often neither the arrival instants of the customers nor their service times are known in advance, queueing theory most often assumes that these processes are random variables. The queueing process itself is then a stochastic process and most often also a Markov process, provided a proper description of the state of the queueing process is introduced. This dissertation investigates numerical methods for a particular type of Markovian queueing systems, namely queueing systems with shared service. These queueing systems differ from traditional queueing systems in that there is simultaneous service of the head-of-line customers of all queues and in that there is no service if there are no customers in one of the queues. The absence of service whenever one of the queues is empty yields particular dynamics which are not found in traditional queueing systems. These queueing systems with shared service are not only beautiful mathematical objects in their own right, but are also motivated by an extensive range of applications. The original motivation for studying queueing systems with shared service came from a particular process in inventory management called kitting. A kitting process collects the necessary parts for an end product in a box prior to sending it to the assembly area. The parts and their inventories being the customers and queues, we get ``shared service'' as kitting cannot proceed if some parts are absent. Still in the area of inventory management, the decoupling inventory of a hybrid make-to-stock/make-to-order system exhibits shared service. The production process prior to the decoupling inventory is make-to-stock and driven by demand forecasts. In contrast, the production process after the decoupling inventory is make-to-order and driven by actual demand as items from the decoupling inventory are customised according to customer specifications. At the decoupling point, the decoupling inventory is complemented with a queue of outstanding orders. As customisation only starts when the decoupling inventory is nonempty and there is at least one order, there is again shared service. Moving to applications in telecommunications, shared service applies to energy harvesting sensor nodes. Such a sensor node scavenges energy from its environment to meet its energy expenditure or to prolong its lifetime. A rechargeable battery operates very much like a queue, customers being discretised as chunks of energy. As a sensor node requires both sensed data and energy for transmission, shared service can again be identified. In the Markovian framework, "solving" a queueing system corresponds to finding the steady-state solution of the Markov process that describes the queueing system at hand. Indeed, most performance measures of interest of the queueing system can be expressed in terms of the steady-state solution of the underlying Markov process. For a finite ergodic Markov process, the steady-state solution is the unique solution of $N-1$ balance equations complemented with the normalisation condition, $N$ being the size of the state space. For the queueing systems with shared service, the size of the state space of the Markov processes grows exponentially with the number of queues involved. Hence, even if only a moderate number of queues are considered, the size of the state space is huge. This is the state-space explosion problem. As direct solution methods for such Markov processes are computationally infeasible, this dissertation aims at exploiting structural properties of the Markov processes, as to speed up computation of the steady-state solution. The first property that can be exploited is sparsity of the generator matrix of the Markov process. Indeed, the number of events that can occur in any state --- or equivalently, the number of transitions to other states --- is far smaller than the size of the state space. This means that the generator matrix of the Markov process is mainly filled with zeroes. Iterative methods for sparse linear systems --- in particular the Krylov subspace solver GMRES --- were found to be computationally efficient for studying kitting processes only if the number of queues is limited. For more queues (or a larger state space), the methods cannot calculate the steady-state performance measures sufficiently fast. The applications related to the decoupling inventory and the energy harvesting sensor node involve only two queues. In this case, the generator matrix exhibits a homogene block-tridiagonal structure. Such Markov processes can be solved efficiently by means of matrix-geometric methods, both in the case that the process has finite size and --- even more efficiently --- in the case that it has an infinite size and a finite block size. Neither of the former exact solution methods allows for investigating systems with many queues. Therefore we developed an approximate numerical solution method, based on Maclaurin series expansions. Rather than focussing on structural properties of the Markov process for any parameter setting, the series expansion technique exploits structural properties of the Markov process when some parameter is sent to zero. For the queues with shared exponential service and the service rate sent to zero, the resulting process has a single absorbing state and the states can be ordered such that the generator matrix is upper-diagonal. In this case, the solution at zero is trivial and the calculation of the higher order terms in the series expansion around zero has a computational complexity proportional to the size of the state space. This is a case of regular perturbation of the parameter and contrasts to singular perturbation which is applied when the service times of the kitting process are phase-type distributed. For singular perturbation, the Markov process has no unique steady-state solution when the parameter is sent to zero. However, similar techniques still apply, albeit at a higher computational cost. Finally we note that the numerical series expansion technique is not limited to evaluating queues with shared service. Resembling shared queueing systems in that a Markov process with multidimensional state space is considered, it is shown that the regular series expansion technique can be applied on an epidemic model for opinion propagation in a social network. Interestingly, we find that the series expansion technique complements the usual fluid approach of the epidemic literature

Integrated performance evaluation of extended queueing network models with line

Despite the large literature on queueing theory and its applications, tool support to analyze these models ismostly focused on discrete-event simulation and mean-value analysis (MVA). This circumstance diminishesthe applicability of other types of advanced queueing analysis methods to practical engineering problems,for example analytical methods to extract probability measures useful in learning and inference. In this toolpaper, we present LINE 2.0, an integrated software package to specify and analyze extended queueingnetwork models. This new version of the tool is underpinned by an object-oriented language to declarea fairly broad class of extended queueing networks. These abstractions have been used to integrate in acoherent setting over 40 different simulation-based and analytical solution methods, facilitating their use inapplications

Analysis of a Multimedia Stream using Stochastic Process Algebra

It is now well recognised that the next generation of distributed systems will be distributed multimedia systems. Central to multimedia systems is quality of service, which defines the non-functional requirements on the system. In this paper we investigate how stochastic process algebra can be used in order to determine the quality of service properties of distributed multimedia systems. We use a simple multimedia stream as our basic example. We describe it in the Stochastic Process Algebra PEPA and then we analyse whether the stream satisfies a set of quality of service parameters: throughput, end-to-end latency, jitter and error rates