Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications

@article{He2018SpaceRF,
  title={Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications},
  author={Qiming He and Attahiru Sule Alfa},
  journal={INFORMS J. Comput.},
  year={2018},
  volume={30},
  pages={1-10}
}
In this paper, we present examples of a class of Markov chains that occur frequently, but whose associated matrices are a challenge to construct efficiently. These are Markov chains that arise as a result of several identical Markov chains running in parallel. Specifically for the cases considered, both the infinitesimal generator matrix for the continuous case, and more so the transition probability matrix for the discrete equivalent, are complex to construct effectively and efficiently. We… 

Figures and Tables from this paper

Two Extensions of Kingman's GI/G/1 Bound

  • F. CiucuFelix Poloczek
  • Mathematics
    Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems
  • 2019
Simulations show that the bounds on waiting time distributions are almost exact in heavy-traffic, including the cases of 1) heterogeneous input, e.g., mixing Weibull and Erlang-k classes and 2) Generalized Markovian Arrival Processes, a new class extending the Batch Markovians Arrival processes to continuous batch sizes.

Point of queue size change analysis of the PH/PH/k system with heterogeneous servers

Multi-Layer MMFF Processes and the MAP/PH/K+GI Queue: Theory and Algorithms

This paper combines the MMFF approach and the count-server-for-phase (CSFP) method to make it possible to analyze it, and to develop an algorithm for computing queueing quantities related to customer abandonment, waiting times, and queue lengths.

Problem of Calculation of Reliability of Hierarchical Complex Technical Systems

An algorithm for assessing reliability based on dividing a complex object into elements, the evaluation of the reliability of which is determined by one of the most suitable methods, such as the Markov models of states and transitions or statistical models, has been developed.

Optimization of Traffic Control in MMAP[k]/PH[k]/S Catastrophic Queueing Model with PH Retrial Times and Preemptive Repeat Policy

A multi-server catastrophic retrial queueing model considering preemptive repeat priority policy with phase-type (PH) distributed retrial times and Behaviour of the proposed system is modelled by the level-dependent-quasi birth death (LDQBD) process.

Optimization of traffic control in $ MMAP\mathit{[2]}/PH\mathit{[2]}/S$ priority queueing model with $ PH $ retrial times and the preemptive repeat policy

A multi-server priority queueing model considering the preemptive repeat policy and phase-type distribution for retrial process and an optimization problem for optimal channel allocation and traffic control has been formulated and dealt by employing appropriate heuristic approaches.

Optimization of Traffic Control in MMAP[c]/PH[c]/S Catastrophic Queueing Model with PH Retrial Times and Controllable Preemptive Repeat Priority Policy

A multi-server catastrophic retrial queueing model considering preemptive repeat priority policy with phase-type ( PH ) distributed retrial times and the Markov chain’s ergodicity criteria are established by demonstrating that it belongs to the class of asymptotically quasi-Toeplitz Markov chains (AQTMC).

Design and reliability analysis of the electrical control system of the subsea control module

The tests and analysis show that the proposed parallel cross-redundancy system is better than the double hot-standby system, as demonstrated by a higher reliability and longer mean time to failure, and the module failure rate effects have been minimized.

Development of the Efficiency Improvement Criterion of the Forming Logistics System

References

SHOWING 1-10 OF 15 REFERENCES

Construction of Markov chains for discrete time MAP/PH/K queues

Representations for matrix-geometric and matrix-exponential steady-state distributions with applications to many-server queues

Neuts has shown that a Markov chain of GI/M/1 type has a matrix-geometric steady-state distribution, extending earlier work by Evans [13] and Wallace [31]. Various authors later observed that, under

Independent markov processes in parallel

We consider c independent Markov processes X i,1≤i≤c, with a common state space Ω = {1,...,m} and a common infinitesimal generator S. A recursive algorithm is developed to compute the infinitesimal

A versatile Markovian point process

  • M. Neuts
  • Mathematics
    Journal of Applied Probability
  • 1979
We introduce a versatile class of point processes on the real line, which are closely related to finite-state Markov processes. Many relevant probability distributions, moment and correlation

Computation of the steady state distribution for multi-server retrial queues with phase type service process

The algorithm that allows to compute the stationary distribution of the system for larger number of servers is described and numerically illustrate its advantage.

An M/PH/K queue with constant impatient time

A number of properties associated with matrices used in the development of the algorithm are shown, which make it possible for the algorithm, under certain conditions, to handle systems with up to one hundred servers.

Algorithms for the multi-server queue with phase type service

We consider the multiserver queue with c phase type servers and a renewal input. It is well-known that the stationary joint distribution of the queue length and the number of servers in each phase of

A Retrial BMAP/PH/N System

A multi-server retrial queueing model with Batch Markovian Arrival Process and phase-type service time distribution is analyzed and the existence conditions for the stationary distribution are obtained and the algorithms for calculating the stationary state probabilities are elaborate.

Calculation of the Steady State Waiting Time Distribution in GI/PH/c and MAP/PH/c Queues

The phase-type representation of W in a FCFS c-server queue is derived in a form which is explicit up to the solution of a matrix fixed point problem; the key new ingredient is a careful study of the not-all-busy period where some or all servers are idle.

Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input

We consider a non-preemptive head of the line multi-server priority model. A generalized Markovian arrival process with marked transitions is used as the arrival process. The service-time