On the construction of component importance measures for semi-Markov systems

Mario Hellmich; Heinz-Peter Berg

doi:10.1007/s00186-012-0413-6

On the construction of component importance measures for semi-Markov systems

Mathematical Methods of Operations Research ◽

10.1007/s00186-012-0413-6 ◽

2012 ◽

Vol 77 (1) ◽

pp. 15-32 ◽

Cited By ~ 1

Author(s):

Mario Hellmich ◽

Heinz-Peter Berg

Keyword(s):

Markov Systems ◽

Component Importance

Download Full-text

OPTIMIZATION OF MARKOV SYSTEMS OF QUEUEING WITH WAITING TIME IN THE MATLAB SYSTEM

VESTNIK OF ASTRAKHAN STATE TECHNICAL UNIVERSITY SERIES MANAGEMENT COMPUTER SCIENCE AND INFORMATICS ◽

10.24143/2072-9502-2017-2-39-47 ◽

2017 ◽

pp. 39-47

Author(s):

Viktor Afonin ◽

Vladimir Valer'evich Nikulin

Keyword(s):

Queueing System ◽

Queueing Systems ◽

Random Variable ◽

Model Systems ◽

Queuing Systems ◽

Input Flow ◽

Continuous Random Variable ◽

Input Stream ◽

Time Intervals ◽

Markov Systems

The article focuses on attempt to optimize two well-known Markov systems of queueing: a multichannel queueing system with finite storage, and a multichannel queueing system with limited queue time. In the Markov queuing systems, the intensity of the input stream of requests (requirements, calls, customers, demands) is subject to the Poisson law of the probability distribution of the number of applications in the stream; the intensity of service, as well as the intensity of leaving the application queue is subject to exponential distribution. In a Poisson flow, the time intervals between requirements are subject to the exponential law of a continuous random variable. In the context of Markov queueing systems, there have been obtained significant results, which are expressed in the form of analytical dependencies. These dependencies are used for setting up and numerical solution of the problem stated. The probability of failure in service is taken as a task function; it should be minimized and depends on the intensity of input flow of requests, on the intensity of service, and on the intensity of requests leaving the queue. This, in turn, allows to calculate the maximum relative throughput of a given queuing system. The mentioned algorithm was realized in MATLAB system. The results obtained in the form of descriptive algorithms can be used for testing queueing model systems during peak (unchanged) loads.

Download Full-text

Graph directed Markov systems on Hilbert spaces

Mathematical Proceedings of the Cambridge Philosophical Society ◽

10.1017/s0305004109002448 ◽

2009 ◽

Vol 147 (2) ◽

pp. 455-488 ◽

Cited By ~ 11

Author(s):

R. D. MAULDIN ◽

T. SZAREK ◽

M. URBAŃSKI

Keyword(s):

Hausdorff Measure ◽

Iterated Function System ◽

Sufficient Conditions ◽

Topological Pressure ◽

Limit Set ◽

Covering Theorem ◽

Limit Sets ◽

Markov Systems ◽

Polish Spaces ◽

Iterated Function

AbstractWe deal with contracting finite and countably infinite iterated function systems acting on Polish spaces, and we introduce conformal Graph Directed Markov Systems on Polish spaces. Sufficient conditions are provided for the closure of limit sets to be compact, connected, or locally connected. Conformal measures, topological pressure, and Bowen's formula (determining the Hausdorff dimension of limit sets in dynamical terms) are introduced and established. We show that, unlike the Euclidean case, the Hausdorff measure of the limit set of a finite iterated function system may vanish. Investigating this issue in greater detail, we introduce the concept of geometrically perfect measures and provide sufficient conditions for geometric perfectness. Geometrical perfectness guarantees the Hausdorff measure of the limit set to be positive. As a by–product of the mainstream of our investigations we prove a 4r–covering theorem for all metric spaces. It enables us to establish appropriate co–Frostman type theorems.

Download Full-text