scholarly journals Optimization of Queueing Model with Server Heating and Cooling

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 768 ◽  
Author(s):  
Olga Dudina ◽  
Alexander Dudin

The operation of many real-world systems, e.g., servers of data centers, is accompanied by the heating of a server. Correspondingly, certain cooling mechanisms are used. If the server becomes overheated, it interrupts processing of customers and needs to be cooled. A customer is lost when its service is interrupted. To prevent overheating and reduce the customer loss probability, we suggest temporal termination of service of new customers when the temperature of the server reaches the predefined threshold value. Service is resumed after the temperature drops below another threshold value. The problem of optimal choice of the thresholds (with respect to the chosen economical criterion) is numerically solved under quite general assumptions about the parameters of the system (Markovian arrival process, phase-type distribution of service time, and accounting for customers impatience). Numerical examples are presented.

2013 ◽  
Vol 31 (4) ◽  
pp. 671-683 ◽  
Author(s):  
A. Krishnamoorthy ◽  
P. K. Pramod ◽  
S. R. Chakravarthy

2018 ◽  
Vol 6 (1) ◽  
pp. 131-138 ◽  
Author(s):  
Femin Yalcin ◽  
Serkan Eryilmaz ◽  
Ali Riza Bozbulut

AbstractIn this paper, a generalized class of run shock models associated with a bivariate sequence {(Xi, Yi)}i≥1 of correlated random variables is defined and studied. For a system that is subject to shocks of random magnitudes X1, X2, ... over time, let the random variables Y1, Y2, ... denote times between arrivals of successive shocks. The lifetime of the system under this class is defined through a compound random variable T = ∑Nt=1 Yt , where N is a stopping time for the sequence {Xi}i≤1 and represents the number of shocks that causes failure of the system. Another random variable of interest is the maximum shock size up to N, i.e. M = max {Xi, 1≤i≤ N}. Distributions of T and M are investigated when N has a phase-type distribution.


1985 ◽  
Vol 22 (01) ◽  
pp. 247-250 ◽  
Author(s):  
David Assaf ◽  
Naftali A. Langberg

It is shown that any phase-type distribution can be represented as a proper mixture of two distinct phase-type distributions. Using different terms, it is shown that the class of phase-type distributions does not include any extreme ones. A similar result holds for the subclass of upper-triangular phase-type distributions.


Risks ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 53
Author(s):  
Franck Adékambi ◽  
Kokou Essiomle

This paper examines the impact of the parameters of the distribution of the time at which a bank’s client defaults on their obligated payments, on the Lundberg adjustment coefficient, the upper and lower bounds of the ruin probability. We study the corresponding ruin probability on the assumption of (i) a phase-type distribution for the time at which default occurs and (ii) an embedding of the stochastic cash flow or the reserves of the bank to the Sparre Andersen model. The exact analytical expression for the ruin probability is not tractable under these assumptions, so Cramér Lundberg bounds types are obtained for the ruin probabilities with concomitant explicit equations for the calculation of the adjustment coefficient. To add some numerical flavour to our results, we provide some numerical illustrations.


1995 ◽  
Vol 8 (2) ◽  
pp. 151-176 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
K. Laurie Dolhun ◽  
S. Chakravarthy

We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.


Sign in / Sign up

Export Citation Format

Share Document