Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K
|
|
- Jason Copeland
- 6 years ago
- Views:
Transcription
1 Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K Attahiru Sule Alfa Department of Mechanical and Industrial Engineering University of Manitoba Winnipeg, Manitoba Canada R3T 5V6 alfa@cc.umanitoba.ca and Yiqiang Q. Zhao Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9 zhao@io.uwinnipeg.ca September 2, 2004 Abstract We consider the PH/PH/1/K queue and the queue of M/G/1 type with very large buffer size K and operating in overload condition. By rotating the resulting transition matrix through 180 o we turn it into a queue with underload condition. By approximating the latter queue by an infinite buffer system we are able to study it using the matrix-geometric method. A procedure for estimating the blocking probabilities is presented. We apply the procedure to a telephone system with both patient and impatient customers. 1 Introduction The interest in the performance analysis of finite buffer queueing models carried out in most telecommunication systems is usually in the overload cases, i.e. when traffic intensities are greater than unity. One of the interesting measures is the blocking or loss probability. There is a large volume of references on this topic, many of which can be found in the Ph.D. thesis 1
2 by Gouweleeuw 2. As such the usual approximating approach for finite buffer queues which is to use the results of infinite buffer queues would not be applicable since the infinite system is not stable. Usually one is left with the only choice which is to carry out the analysis using standard finite Markov chain analysis approach. This approach is extremely time consuming especially when the buffer size is very large; for example buffer sizes in the thousands are not uncommon (Zhao and Alfa 11 and Zhao and Campbell 10). In a recent paper, Zhao 12 presented the method of rotation which can be used to accurately estimate the steady state distributions of such systems when they are the M/G/1 and GI/M/1 queues or their variants. The method is based on the premise that: if a single server queue with a finite buffer is transformed to another queue whose interarrival time is the service time of the original queue and the service time is the interarrival time of the original queue, then the traffic intensity of the new queue is the reciprocal of the traffic intensity of the original queue. The transition matrix of the Markov chain representing the new queue is the transition matrix representing the Markov chain of the old queue but rotated through 180 o. The resulting invariant vector of the new matrix is the mirror image of that of the original matrix. If the buffer size is very large, which is the case that normally poses the major computational problem, we can then rotate the system of such queue with high overload, thereby resulting in an underload case and then approximating that by an infinite buffer model. In this paper, we show how the method can be extended to quasi-birth-and-death models such as the PH/PH/1/K queues and to the queues of M/G/1/K type, which includes an interesting application to a telephone system with both patient and impatient customers. 2 The main result Since the rotation procedure is the same for both the PH/PH/1/K queue and the queue of M/G/1/K type, we only go details for the PH/PH/1/K queue. 2.1 The P H/P H/1/K queue Since we are only interested in results in steady state, we will consider the generator of the model, or the uniformized trasition matrix. Alternatively, we use the discrete time 2
3 representation for a phase type distribution. We consider a finite buffer single server queue in which interarrival times have the phase type distribution represented by (α,t) of dimension n with mean λ 1, and service times which are also of the phase type distribution represented by (β,s) of dimension m with mean µ 1. In the representation of a phase type distribution, the first variable is a vector and the second is a square matrix (Neuts 7). Let the buffer size be K. The PH/PH/1/K type queue occurs frequently in manufacturing systems. As pointed out by Buzacott and Shanthikumar 1 phase-type distributions do naturally occur for service times in manufacturing. For example service to a job involves performing several tasks each of which has an exponential time distribution. As for phase type arrivals it is well known that several types of interarrival times (which are independent and identically distributed) in most practical queueing systems can be represented or approximated by phase type distributions. In addition the buffer spaces in such systems are usually finite. As such PH/PH/1/K queues do occur frequently in manufacturing systems. Now, consider two other phase type distributions represented by (α,t ) of dimension n and (β,s ) of dimension m. We assume that these two are related to the first two as follows: and α i = α n i+1 and T i,j = T n i+1,n j+1, 1 i,j n (1) β i = β m i+1 and S i,j = S m i+1,m j+1, 1 i,j m. (2) It is clear that the two phase types represented by (α,t) and by (α,t ) are stochastically equivalent, similarly those represented by (β,s) and by (β,s ). We define T 0 = e Te, T 0 = e T e, S 0 = e Se, and S 0 = e S e, (3) where e is a column vector of ones. The case we are interested in is such that λ/µ > 1, i.e. the overload case. Note that the buffer size K <. The state space describing the Markov chain representing the P H/P H/1/K queue is given as = {(0,j) (i,j,k), 1 i K + 1, 1 j n, 1 k m}, where (0,j) represents 3
4 the states when the system is empty and the arrival is in phase j and (i,j,k) represents when there are i customers in the system, the arrival is in phase j and service is in phase k. The transition matrix P representing this Markov chain is given as where, P = B 00 B 01 B 10 A 1 A 0 A 2 A 1 A 0 A 2 C, (4) B 00 = T, B 01 = (T 0 α) β, B 10 = T S 0, A 0 = (T 0 α) S, (5) A 1 = (T 0 α) (S 0 β) + T S, A 2 = T (S 0 β), C = A 1 + A 0. (6) Let x = x 0, x 1,, x K+1 be the probability invariant vector associated with P. Then we have xp = x, and xe = 1. (7) Our interest is to compute the blocking probability P b = x K+1 e. Once again, the system is overloaded which implies that (see Neuts 7) πψ < 1, where π = πa, πe = 1, A = A 0 + A 1 + A 2 and ψ = A 1 e + 2A 2 e. If we now rotate P to obtain where, P = C A 2 A 0 A 1 A 2 A 0 A 1 A 2 A 0 A 1 B10 B01 B00, (8) B 00 = T, B 01 = (T 0 α ) β, B 10 = T S 0, A 0 = (T 0 α ) S, (9) A 1 = (T 0 α ) (S 0 β ) + T S, A 2 = T (S 0 β ), C = A 1 + A 0. (10) Let y = y 0, y 1,, y K+1 be the probability invariant vector associated with P. The following lemma provides the relationship between x and y. 4
5 Lemma 1 Let X t be a Markov chain with state space {(i,j),i = 0, 1, 2,,j = 1, 2,,n} and transition matrix P = P 00 P 01 P 0K P 10 P 11 P 1K... P K0 P K1 P KK, (11) where P ij = (P ij (r,s)) are matrices of size n n. Define Y t = (K + 1,n + 1) X t, which means that Y t = (K + 1 i,n + 1 j) if X t = (i,j). Then, the transition matrix P of the Markov chain Y t given by P = P 00 P 01 P 0K P 10 P 11 P 1K... PK0 PK1 PKK, (12) where P ij = (P ij(r,s)) with P ij(r,s) = P K+1 i,k+1 j (n + 1 r,n + 1 s) is the rotation of P by 180 o. The probability invariant vectors x = x 0,x 1,,x K and y = y 0,y 1,,y K corresponding to X t and Y t, respectively, are related by or y i is the rotation of x K+1 i. y i (j) = x K+1 i (n + 1 j), (13) The proof of the lemma is clear if one notices that the rotation P of the transition matrix P is the transition matrix for the Markov chain obtained by renumbering the states in the state space of the original Markov chain. An immediate consequence is Corollary 1 Let x = x 0, x 1,, x K+1 and y = y 0, y 1,, y K+1 be the probability invariant vectors associated with P and P given in 4 and 8, respectively, then y i is the rotation of x K i+1. By noticing the details in the transition matrix P in 8, we find that the Markov chain described by this transition matrix is that of another PH/PH/1/K queue in which the interarrival time has a phase type distribution represented by (β,s ) and the service time is a phase type distribution represented by (α,t ). Let π = π A, π e = 1 and A = A 2 + A 1 + A 0, then π im+v = π (n i)m+m v, i = 0, 1,,n 1;v = 1, 2,,m and A i,j = A n i+1,m j+1. Hence π ψ = πψ, where ψ = A 1e + 2A 2e and π i are the elements of π. 5
6 Theorem 1 π δ > 1, where π = π A, π e = 1, A = A 2+A 1+A 0 and δ = A 1e+2A 0e. Proof δ = A 1e + 2A 0e = A 1e + 2(A e A 1e A 2e) = 2e A 1e 2A 2e = 2e ψ. Multiplying both sides by π we obtain π δ = 2π e π ψ = 2 πψ. Noting that πψ < 1 then we have π δ > 1. We can now approximate this Markov chain by an infinite state Markov chain with the following transition matrix P = C A 2 A 0 A 1 A 2 A 0 A 1 A 2. (14) This Markov chain is stable because according to Theorem 1 its traffic intensity is µ/λ < 1. Let z = z 0, z 1, be the invariant vector associated with P. The convergence of y to z has been established by Li and Zhao 5. Now, we can approximate x K+1 by z 0. We use matrix-geometric approach to compute the relevant parameters (Neuts 7). First we notice that the matrix R is the minimal non-negative solution to the matrix quadratic equation R = A 2 + RA 1 + R 2 A 0. (15) R can be computed using various available algorithms; for example, a logarithmic reduction algorithm by Latouche and Ramaswami 4. Having obtained R we can then calculate z i recursively as follows: z i+1 = z i R, i 1 or z i+1 = z 1 R i, i 0. (16) Therefore, the key computation left now is the boundary probability vector (z 0, z 1 ). Define the matrix BR as C A BR = 2 A 0 A 1 + RA 0 6. (17)
7 According to Neuts 7, the vector (z 0, z 1 ) can be computed by solving (z 0, z 1 ) = (z 0, z 1 ) BR subject to the normalization condition: (z 0 + z 1 (I R) 1 )e = 1. (18) The blocking probability P b of the original overflow queue, which is given by x K+1 e is now approximated by z 0 e. Even though our interest is mainly in the blocking probabilities every other element of the invariant vector can also be reasonably approximated. We have z K+1 i,n j+1,m v+1 y K+1 i,n j+1,m v+1 = x i,j,v, (19) where z = z 0,z 1,, z i = z i,1,1,,z i,1,n,z i,2,1,,z i,j,v,,z i,n,m, y = y 0,y 1,,y K+1, y i = y i,1,1,,y i,1,n,y i,2,1,,y i,j,v,,y i,n,m, (20) x = x 0,x 1,,x K+1, x i = x i,1,1,,x i,1,n,x i,2,1,,x i,j,v,,x i,n,m. We now present some illustrative examples. In example 1 and example 2, we let the buffer space be 100. Example 1 Let the service time be a phase distribution represented by β = , S = We consider the following cases: Case 1: α = 1 0, T = ; Case 2: α = 1 0, T = Case 3: α = 1 0, T = Case 4: α = 1 0, T = Case 5: α = 1 0, T = ; ; 7 ;
8 We report the difference between the blocking probabilities as calculated using the transition matrix P and using the approximation. The true blocking probabilities reported in all tables were computed by solving the stationary equations using the highly numerically stable GTH algorithm (Grassmann, Taksar and Heyman 3). Table 1: Difference in Blocking Probabilities for the Two Methods for Example 1. Case ρ P b difference in blocking prob Example Let the service time be a phase distribution represented by β = , S = We consider the arrival processes in Example 1 and label them Cases The resulting differences in the blocking probabilities are shown in Table 2 below. Table 2: Difference in Blocking Probabilities for the Two Methods for Example 2. Case ρ P b difference in blocking prob The queue of M/G/1/K type In this subsection, we apply the rotation procedure to a telephone switch system, where the impact of the presence of impatient customers on the system under overloaded conditions will be studied. This same system was first studied in Zhao and Alfa 11 under a stable condition. They were not able to perform an overload analysis. For this purpose, we need consider a discrete time Markov chain of M/G/1/K type. Once again, we are interested in the performance measures for the model of finite buffer K with K very large. This type of Markov chains can be treated as a truncated version of the Markov chains of M/G/1 type 8
9 studied by Neuts 8. More specifically, the transition matrix of a Markov chain of M/G/1/K type is given by P = B 0 B 1 B 2 B K 1 i K B i A 0 A 1 A 2 A K 1 i K A i A 0 A 1 A K 2 i K 1 A i A 0 A K 3 i K 2 A i.... A 0 i 1 A i, (21) where all submatrices B i and A i are of size (m + 1) (m + 1). We assume that P and A = i=0 A i are irreducible. Let π be the probability invariant vector for A. Define β = i=1 ia i e. We assume that the system is operated under the overloaded condition: πβ > 1. Let x = x 0, x 1,, x K+1 be the invariant vector associated with P. Then we have xp = x and xe = 1. One of our interests is to compute the blocking probability defined by P b = x K+1 e by using the rotation procedure. For the telephone system, a 0 a 1 a 2 a m 1 a m a m+j a 0 a 1 a 2 a m 1 a m a m+j 0 a 0 a 1 a m 2 a m a m 1+j B 0 = 0 0 a 0 a m 3 a, B m 2 j = a m 2+j a 0 a a 1+j for j = 1, 2,, and A 0 = b 0 b 1 b 2 b m 1 b m , A 1 = and b m+j a m 1+j A j = a m 2+j a j for j = 2, 3,. In the above matrices, for k = 0, 1, 2,, a k = ak k! e a and b k = bk k! e b b m+1 a 0 a 1 a 2 a m 1 a m 0 a 0 a 1 a m 2 a m a 0 a 1,
10 Let E(T) be the average service time of a customer. We are then interested in the overloaded case: λe(t) > 1. The blocking probability P b = y 0 e. In the above equation, y = (y 0,y 1,,y K ) is the invariant probability vector of the rotated Markov chain i 1 A i A 0 i 2 A i A 1 A 0 P =..., (22) i K A i A K 1 A K 2 A 1 A 0 i K Bi BK 1 BK 2 B1 B0 where A i and B i are rotations of A i and B i, respectively. The infinite version P of the rotated transition matrix is given by i 1 A i A 0 i 2 A i A 1 A 0 P = i 3 A i A 2 A 1 A which is of GI/M/1 type. In general, this Markov chain of GI/M/1 type is stable since π β = πβ > 1 where A = i=0 A i and β = i=1 ia ie. According to Li and Zhao 5, P is block-monotone and therefore any block-augmentation converges. As a consequence, P converges to P in the sense that y converges to the invariant vector z associated with P. Since the buffer size K in our case is large, z approximates y. Therefore, the blocking probability can be approximated using z 0 e. z 0 is the invariant vector of BR = k=0 R k B k with B k = i=k+1 A i and R the rate matrix and normalized by z 0 (I R) 1 e = 1. For the telephone system, notice that A 0 = ωβ with ω = (0, 0,,0,b m ) a column vector, where b m = m i=0 b i, and β = (b m,b m 1,,b 0 )/b m. It follows from the results in Ramaswami and Latouche 9, also see Liu and Zhao 6, that 1 R = A 0 I η i 1 A i, i=1 or R = ωξ, where 1 ξ = β I η i 1 A i, (23) i=1 and η = ξω is the maximal eigenvalue of R. Since only the last element in ω is not zero, all rows of R are zero except the last one, which is denoted by r = (r 0,r 1,,r m ) with 10,
11 r m = η. For our case, η can be easily found by computing the positive root, which is less than 1, of determinant det(η k=0 η k A k ) (see Liu and Zhao 6). After finding η, we now can compute ξ using (23). It leads to the following recursive determination. ξ m = η b m, ξ m 1 ξ m k = ξ m b 0 /b m a 0, = (1 a 1)ξ m k+1 a 2 ξ m k+2 a k 1 ξ m 1 b k 1 /b m a 0, k = 2, 3,,m. Finally, r k = b m ξ k, k = 0, 1,,m. In the following, we will use the same parameter values used in Zhao and Alfa 11, that is, the buffer size m = 10 for patient customers, the buffer size K = 100 for impatient customers, the service time a = 1.5 for a patient customer, and the service time b = 1 for an impatient customer. The overload condition can be proved to be λ > 0.68 (see Zhao and Alfa 11). In Table 3 and Table 4, r, and the true blocking probability P b and the error, which is the difference of the blocking probabilities between the true one and the approximation, are provided for different values of λ, respectively. Table 3: The Last Row of the Rate Matrix. λ r 0 r 1 r 2 r 3 r 4 r 5 r 6 r 7 r 8 r 9 r
12 Table 4: The True Blocking Probability and the Error of Approximation. λ True P b Error < < < < < Acknowledgements: The authors acknowledge that this work was supported by research grants from the Natural Sciences and Engineering Research Council of Canada (NSERC) and also thank the referees for their valuable comments. References 1 Buzacott, J. A. and Shanthikumar, J. G. (1993), Stochastic Models of Manufacturing Systems, Prentice Hall, Englewood Cliffs, N.J. 2 Gouweleeuw, F.N. (1996), A General Approach to Computing Loss Probabilities in Finite-Buffer Queues, Ph.D. Thesis, Free University, Amsterdam. 3 Grassmann, W.K., Taksar, M.I. and Heyman, D.P. (1985), Regenerative analysis and steady state distributions for Markov chains, Operations Research, Vol. 33, Latouche, G. and Ramaswami, V. (1993), A logarithmic reduction algorithm for quasibirth-death processes, J. Appl. Prob., Vol. 30, Li, H. and Zhao, Y.Q. (1999), Stochastic block-monotone matrix and approximating the stationary distribution of infinite Markov chains, accepted by Stochastic Models. 6 Liu, D. and Zhao, Y.Q. (1996), Determination of explicit solution for a general class of Markov processes, Matrix-Analytic Methods in Stochastic Models, S. Chakravarthy and A. S. Alfa, Eds, Marcel Dekker, Neuts, M. F. (1981), Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach, The Johns Hopkins University Press, Baltimore. 8 Neuts, M. F. (1989), Structured stochastic matrices of M/G/1 type and their applications, Marcel Dekker Inc., New York. 12
13 9 Ramaswami, V. and Latouche, G. (1986), A general class of Markov processes with explicit matrix-geometric solutions, OR Spektrum, , Vol Zhao, Y. Q. and Campbell, L. L. (1995), Performance analysis of a multibeam packet satellite system using random access techniques, Performance Evaluation, Vol. 22, Zhao, Y. Q. and Alfa, A. S. (1995), Performance analysis of a telephone system with patient and impatient customers, Telecommunication Systems, Vol. 4, Zhao, Y. Q. (1998), Overload analysis for Markovian models, System Sci. and System Eng., accepted. 13
Censoring Technique in Studying Block-Structured Markov Chains
Censoring Technique in Studying Block-Structured Markov Chains Yiqiang Q. Zhao 1 Abstract: Markov chains with block-structured transition matrices find many applications in various areas. Such Markov chains
More informationStationary Probabilities of Markov Chains with Upper Hessenberg Transition Matrices
Stationary Probabilities of Marov Chains with Upper Hessenberg Transition Matrices Y. Quennel ZHAO Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba CANADA R3B 2E9 Susan
More informationDeparture Processes of a Tandem Network
The 7th International Symposium on perations Research and Its Applications (ISRA 08) Lijiang, China, ctober 31 Novemver 3, 2008 Copyright 2008 RSC & APRC, pp. 98 103 Departure Processes of a Tandem Network
More informationAdvanced Queueing Theory
Advanced Queueing Theory 1 Networks of queues (reversibility, output theorem, tandem networks, partial balance, product-form distribution, blocking, insensitivity, BCMP networks, mean-value analysis, Norton's
More informationMatrix analytic methods. Lecture 1: Structured Markov chains and their stationary distribution
1/29 Matrix analytic methods Lecture 1: Structured Markov chains and their stationary distribution Sophie Hautphenne and David Stanford (with thanks to Guy Latouche, U. Brussels and Peter Taylor, U. Melbourne
More informationCHUN-HUA GUO. Key words. matrix equations, minimal nonnegative solution, Markov chains, cyclic reduction, iterative methods, convergence rate
CONVERGENCE ANALYSIS OF THE LATOUCHE-RAMASWAMI ALGORITHM FOR NULL RECURRENT QUASI-BIRTH-DEATH PROCESSES CHUN-HUA GUO Abstract The minimal nonnegative solution G of the matrix equation G = A 0 + A 1 G +
More informationMulti Stage Queuing Model in Level Dependent Quasi Birth Death Process
International Journal of Statistics and Systems ISSN 973-2675 Volume 12, Number 2 (217, pp. 293-31 Research India Publications http://www.ripublication.com Multi Stage Queuing Model in Level Dependent
More informationModelling Complex Queuing Situations with Markov Processes
Modelling Complex Queuing Situations with Markov Processes Jason Randal Thorne, School of IT, Charles Sturt Uni, NSW 2795, Australia Abstract This article comments upon some new developments in the field
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationA FAST MATRIX-ANALYTIC APPROXIMATION FOR THE TWO CLASS GI/G/1 NON-PREEMPTIVE PRIORITY QUEUE
A FAST MATRIX-ANAYTIC APPROXIMATION FOR TE TWO CASS GI/G/ NON-PREEMPTIVE PRIORITY QUEUE Gábor orváth Department of Telecommunication Budapest University of Technology and Economics. Budapest Pf. 9., ungary
More informationA Joining Shortest Queue with MAP Inputs
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 25 32 A Joining Shortest Queue with
More informationA Single-Server Queue with Markov Modulated Service Times
A Single-Server Queue with Markov Modulated Service Times Noah Gans Yong-Pin Zhou OPIM Department Dept. of Management Science The Wharton School School of Business Administration University of Pennsylvania
More informationM/M/1 Queueing System with Delayed Controlled Vacation
M/M/1 Queueing System with Delayed Controlled Vacation Yonglu Deng, Zhongshan University W. John Braun, University of Winnipeg Yiqiang Q. Zhao, University of Winnipeg Abstract An M/M/1 queue with delayed
More informationStructured Markov chains solver: tool extension
Structured Markov chains solver: tool extension D. A. Bini, B. Meini, S. Steffé Dipartimento di Matematica Università di Pisa, Pisa, Italy bini, meini, steffe @dm.unipi.it B. Van Houdt Department of Mathematics
More informationStochastic inventory management at a service facility with a set of reorder levels
Volume 23 (2), pp. 137 149 http://www.orssa.org.za ORiON ISSN 0529-191-X c 2007 Stochastic inventory management at a service facility with a set of reorder levels VSS Yadavalli B Sivakumar G Arivarignan
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More informationN.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a
WHEN IS A MAP POISSON N.G.Bean, D.A.Green and P.G.Taylor Department of Applied Mathematics University of Adelaide Adelaide 55 Abstract In a recent paper, Olivier and Walrand (994) claimed that the departure
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationStochastic Models. Edited by D.P. Heyman Bellcore. MJ. Sobel State University of New York at Stony Brook
Stochastic Models Edited by D.P. Heyman Bellcore MJ. Sobel State University of New York at Stony Brook 1990 NORTH-HOLLAND AMSTERDAM NEW YORK OXFORD TOKYO Contents Preface CHARTER 1 Point Processes R.F.
More informationLIGHT-TAILED ASYMPTOTICS OF STATIONARY PROBABILITY VECTORS OF MARKOV CHAINS OF GI/G/1 TYPE
Adv. Appl. Prob. 37, 1075 1093 (2005) Printed in Northern Ireland Applied Probability Trust 2005 LIGHT-TAILED ASYMPTOTICS OF STATIONARY PROBABILITY VECTORS OF MARKOV CHAINS OF GI/G/1 TYPE QUAN-LIN LI,
More informationA Heterogeneous Two-Server Queueing System with Balking and Server Breakdowns
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 230 244 A Heterogeneous Two-Server Queueing
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationMatrix Analytic Methods for Stochastic Fluid Flows
Matrix Analytic Methods for Stochastic Fluid Flows V. Ramaswami, AT&T Labs, 2 Laurel Avenue D5-3B22, Middletown, NJ 7748 We present an analysis of stochastic fluid flow models along the lines of matrix-analytic
More informationAnalysis of a tandem queueing model with GI service time at the first queue
nalysis of a tandem queueing model with GI service time at the first queue BSTRCT Zsolt Saffer Department of Telecommunications Budapest University of Technology and Economics, Budapest, Hungary safferzs@hitbmehu
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More informationQUASI-BIRTH-AND-DEATH PROCESSES, LATTICE PATH COUNTING, AND HYPERGEOMETRIC FUNCTIONS
September 17, 007 QUASI-BIRTH-AND-DEATH PROCESSES, LATTICE PATH COUNTING, AND HYPERGEOMETRIC FUNCTIONS J. S. H. van Leeuwaarden 1 M. S. Squillante E. M. M. Winands 3 Abstract This paper considers a class
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationQBD Markov Chains on Binomial-Like Trees and its Application to Multilevel Feedback Queues
QBD Markov Chains on Binomial-Like Trees and its Application to Multilevel Feedback Queues B. Van Houdt, J. Van Velthoven and C. Blondia University of Antwerp, Middelheimlaan 1, B-2020 Antwerpen, Belgium
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationA Queueing Model for Sleep as a Vacation
Applied Mathematical Sciences, Vol. 2, 208, no. 25, 239-249 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/ams.208.8823 A Queueing Model for Sleep as a Vacation Nian Liu School of Mathematics and
More informationQueueing Networks and Insensitivity
Lukáš Adam 29. 10. 2012 1 / 40 Table of contents 1 Jackson networks 2 Insensitivity in Erlang s Loss System 3 Quasi-Reversibility and Single-Node Symmetric Queues 4 Quasi-Reversibility in Networks 5 The
More informationLecture 10: Semi-Markov Type Processes
Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov
More informationQueuing Analysis of Markovian Queue Having Two Heterogeneous Servers with Catastrophes using Matrix Geometric Technique
International Journal of Statistics and Systems ISSN 0973-2675 Volume 12, Number 2 (2017), pp. 205-212 Research India Publications http://www.ripublication.com Queuing Analysis of Markovian Queue Having
More informationThe Transition Probability Function P ij (t)
The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationM/M/3/3 AND M/M/4/4 RETRIAL QUEUES. Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
JOURNAL OF INDUSTRIAL AND doi:10.3934/imo.2009.5.431 MANAGEMENT OPTIMIZATION Volume 5, Number 3, August 2009 pp. 431 451 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Tuan Phung-Duc, Hiroyuki Masuyama, Shoi Kasahara
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive
More informationWaiting-Time Distribution of a Discrete-time Multiserver Queue with Correlated. Arrivals and Deterministic Service Times: D-MAP/D/k System
Waiting-Time Distribution of a Discrete-time Multiserver Queue with Correlated Arrivals and Deterministic Service Times: D-MAP/D/k System Mohan L. Chaudhry a, *, Bong K. Yoon b, Kyung C. Chae b a Department
More informationECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains
ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 4: Discrete-Time Markov Chains September 1, 215 Dr. Itamar Arel College of Engineering Department of Electrical Engineering & Computer
More informationA Perishable Inventory System with Service Facilities and Negative Customers
AMO - Advanced Modeling and Optimization, Volume 7, Number 2, 2005 A Perishable Inventory System with Service Facilities and Negative Customers B. Sivakumar 1 and G. Arivarignan 2 Department of Applied
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationJitter Analysis of an MMPP 2 Tagged Stream in the presence of an MMPP 2 Background Stream
Jitter Analysis of an MMPP 2 Tagged Stream in the presence of an MMPP 2 Background Stream G Geleji IBM Corp Hursley Park, Hursley, UK H Perros Department of Computer Science North Carolina State University
More informationM/M/1 Retrial Queueing System with Negative. Arrival under Erlang-K Service by Matrix. Geometric Method
Applied Mathematical Sciences, Vol. 4, 21, no. 48, 2355-2367 M/M/1 Retrial Queueing System with Negative Arrival under Erlang-K Service by Matrix Geometric Method G. Ayyappan Pondicherry Engineering College,
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationCS 798: Homework Assignment 3 (Queueing Theory)
1.0 Little s law Assigned: October 6, 009 Patients arriving to the emergency room at the Grand River Hospital have a mean waiting time of three hours. It has been found that, averaged over the period of
More informationOn Successive Lumping of Large Scale Systems
On Successive Lumping of Large Scale Systems Laurens Smit Rutgers University Ph.D. Dissertation supervised by Michael Katehakis, Rutgers University and Flora Spieksma, Leiden University April 18, 2014
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationA Direct Approach to Transient Queue-Size Distribution in a Finite-Buffer Queue with AQM
Appl. Math. Inf. Sci. 7, No. 3, 99-915 (213) 99 Applied Mathematics & Information Sciences An International Journal A Direct Approach to Transient Queue-Size Distribution in a Finite-Buffer Queue with
More informationInventory Ordering Control for a Retrial Service Facility System Semi- MDP
International Journal of Engineering Science Invention (IJESI) ISS (Online): 239 6734, ISS (Print): 239 6726 Volume 7 Issue 6 Ver I June 208 PP 4-20 Inventory Ordering Control for a Retrial Service Facility
More informationA GENERALIZED MARKOVIAN QUEUE TO MODEL AN OPTICAL PACKET SWITCHING MULTIPLEXER
A GENERALIZED MARKOVIAN QUEUE TO MODEL AN OPTICAL PACKET SWITCHING MULTIPLEXER RAM CHAKKA Department of Computer Science Norfolk State University, USA TIEN VAN DO, ZSOLT PÁNDI Department of Telecommunications
More informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationQueuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general
More informationDiscriminatory Processor Sharing Queues and the DREB Method
Lingnan University From the SelectedWorks of Prof. LIU Liming 2008 Discriminatory Processor Sharing Queues and the DREB Method Z. LIAN, University of Macau X. LIU, University of Macau Liming LIU, Hong
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More informationQueue Decomposition and its Applications in State-Dependent Queueing Systems
Submitted to Manufacturing & Service Operations Management manuscript Please, provide the mansucript number! Authors are encouraged to submit new papers to INFORMS journals by means of a style file template,
More informationON THE LAW OF THE i TH WAITING TIME INABUSYPERIODOFG/M/c QUEUES
Probability in the Engineering and Informational Sciences, 22, 2008, 75 80. Printed in the U.S.A. DOI: 10.1017/S0269964808000053 ON THE LAW OF THE i TH WAITING TIME INABUSYPERIODOFG/M/c QUEUES OPHER BARON
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationApproximate analysis of single-server tandem queues with finite buffers
Ann Oper Res (2013) 209:67 84 DOI 10.1007/s10479-011-1021-1 Approximate analysis of single-server tandem queues with finite buffers Remco Bierbooms Ivo J.B.F. Adan Marcel van Vuuren Published online: 16
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationOVERCOMING INSTABILITY IN COMPUTING THE FUNDAMENTAL MATRIX FOR A MARKOV CHAIN
SIAM J. MATRIX ANAL. APPL. c 1998 Society for Industrial and Applied Mathematics Vol. 19, No. 2, pp. 534 540, April 1998 015 OVERCOMING INSTABILITY IN COMPUTING THE FUNDAMENTAL MATRIX FOR A MARKOV CHAIN
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationReadings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationLecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits. IEOR 4615: Service Engineering Professor Whitt February 19, 2015
Lecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits IEOR 4615: Service Engineering Professor Whitt February 19, 2015 Outline Deterministic Fluid Models Directly From Data: Cumulative
More informationA TANDEM QUEUE WITH SERVER SLOW-DOWN AND BLOCKING
Stochastic Models, 21:695 724, 2005 Copyright Taylor & Francis, Inc. ISSN: 1532-6349 print/1532-4214 online DOI: 10.1081/STM-200056037 A TANDEM QUEUE WITH SERVER SLOW-DOWN AND BLOCKING N. D. van Foreest
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationOn the Class of Quasi-Skip Free Processes: Stability & Explicit solutions when successively lumpable
On the Class of Quasi-Skip Free Processes: Stability & Explicit solutions when successively lumpable DRAFT 2012-Nov-29 - comments welcome, do not cite or distribute without permission Michael N Katehakis
More informationSolving Nonlinear Matrix Equation in Credit Risk. by Using Iterative Methods
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 39, 1921-1930 Solving Nonlinear Matrix Equation in Credit Risk by Using Iterative Methods a,b Gholamreza Farsadamanollahi 1, b Joriah Binti Muhammad and
More informationAN M/M/1 QUEUE IN RANDOM ENVIRONMENT WITH DISASTERS
Asia-Pacific Journal of Operational Research Vol. 3, No. 3 (204) 45006 (2 pages) c World Scientific Publishing Co. & Operational Research Society of Singapore DOI: 0.42/S027595945006X AN M/M/ QUEUE IN
More informationRetrial queue for cloud systems with separated processing and storage units
Retrial queue for cloud systems with separated processing and storage units Tuan Phung-Duc Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro-ku, Tokyo, Japan
More informationCharacterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation 1
Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation 1 Qi Zhang Armin Heindl Evgenia Smirni Department of Computer Science Computer Networks and Comm Systems Department of Computer
More informationOn Tandem Blocking Queues with a Common Retrial Queue
On Tandem Blocking Queues with a Common Retrial Queue K. Avrachenkov U. Yechiali Abstract We consider systems of tandem blocking queues having a common retrial queue, for which explicit analytic results
More informationQueueing systems in a random environment with applications
Queueing systems in a random environment with applications Ruslan Krenzler, Hans Daduna Universität Hamburg OR 2013 3.-6. September 2013 Krenzler, Daduna (Uni HH) Queues in rnd. environment OR 2013 1 /
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationAnalysis of Discrete-Time Server Queues with Bursty Markovian Inputs
INTERNATIONAL CONFERENCE ON ADVANCES IN COMMUNICATIONS AND CONTROL, RHODES, GREECE, JUNE 1993. 1 Analysis of Discrete-Time Server Queues with Bursty Markovian Inputs Panagiotis Mavridis George V. Moustakides
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationInternational Journal of Pure and Applied Mathematics Volume 28 No ,
International Journal of Pure and Applied Mathematics Volume 28 No. 1 2006, 101-115 OPTIMAL PERFORMANCE ANALYSIS OF AN M/M/1/N QUEUE SYSTEM WITH BALKING, RENEGING AND SERVER VACATION Dequan Yue 1, Yan
More informationAnalysis of an M/G/1 queue with customer impatience and an adaptive arrival process
Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process O.J. Boxma 1, O. Kella 2, D. Perry 3, and B.J. Prabhu 1,4 1 EURANDOM and Department of Mathematics & Computer Science,
More informationOn Tandem Blocking Queues with a Common Retrial Queue
On Tandem Blocking Queues with a Common Retrial Queue K. Avrachenkov U. Yechiali Abstract We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short
More informationPart II: continuous time Markov chain (CTMC)
Part II: continuous time Markov chain (CTMC) Continuous time discrete state Markov process Definition (Markovian property) X(t) is a CTMC, if for any n and any sequence t 1
More informationarxiv:math/ v1 [math.pr] 24 Mar 2005
The Annals of Applied Probability 2004, Vol. 14, No. 4, 2057 2089 DOI: 10.1214/105051604000000477 c Institute of Mathematical Statistics, 2004 arxiv:math/0503555v1 [math.pr] 24 Mar 2005 SPECTRAL PROPERTIES
More informationAnalysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations
Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations Yan Zhang 1 Dequan Yue 1 Wuyi Yue 2 1 College of Science, Yanshan University, Qinhuangdao 066004 PRChina 2 Department of Information
More informationChapter 3 Balance equations, birth-death processes, continuous Markov Chains
Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationSTABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL
First published in Journal of Applied Probability 43(1) c 2006 Applied Probability Trust STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL LASSE LESKELÄ, Helsinki
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationLecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes
Lecture Notes 7 Random Processes Definition IID Processes Bernoulli Process Binomial Counting Process Interarrival Time Process Markov Processes Markov Chains Classification of States Steady State Probabilities
More information