M/M/3/3 AND M/M/4/4 RETRIAL QUEUES. Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara and Yutaka Takahashi
|
|
- Richard Hawkins
- 5 years ago
- Views:
Transcription
1 JOURNAL OF INDUSTRIAL AND doi: /imo MANAGEMENT OPTIMIZATION Volume 5, Number 3, August 2009 pp M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Tuan Phung-Duc, Hiroyuki Masuyama, Shoi Kasahara and Yutaka Takahashi Graduate School of Informatics, Kyoto University Yoshida-Honmachi, Sakyo-ku, Kyoto , Japan Abstract. This paper studies M/M/c/c retrial queues, where c servers are all identical. In the retrial queues, an arriving customer is served immediately if it finds an idle server upon arrival, otherwise the customer tries to enter the system after an exponentially distributed time independently of other customers. As is well known, it is a challenging problem to obtain an analytical solution for the stationary oint distribution of the numbers of retrial customers and busy servers in the M/M/c/c retrial queue especially for c 3. Under some technical assumptions, a few analytical solutions have been presented for c 3. This paper derives analytical solutions for M/M/3/3 and M/M/4/4 retrial queues without such technical assumptions. Through many numerical examples, we show that the derived analytical solutions can be computed by a numerically stable algorithm. 1. Introduction. This paper considers M/M/c/c retrial queues, where c servers are all identical. Customers arrive at the system according to a Poisson process with a rate λ > 0, and their service times are independent and identically distributed (i.i.d. according to an exponential distribution with mean one. Each arriving customer receives service immediately if it finds an idle server on arrival. Otherwise the arriving customer oins a virtual pool, say orbit. A customer in the orbit is called as a retrial customer hereafter. Each retrial customer stays in the orbit for an exponentially distributed time with finite positive mean 1/µ independently of other customers. After the soourn time in the orbit, a retrial customer tries to enter the system and is served immediately if at least one server is idle on its retrial, otherwise it returns to the orbit again. Let C(t and N(t (t 0 denote the numbers of busy servers and retrial customers, respectively, at time t. It is easy to see that X(t = (C(t, N(t (t 0 forms an irreducible level-dependent quasi-birth-and-death process with the state space {0, 1,..., c} Z +, where Z + = {0, 1, 2,... }. It is known that X(t (t 0 is ergodic if and only if λ < c (see, e.g., pp in [3]. Throughout the paper, we assume λ < c and then define i, (i = 0, 1,...,c, Z + as i, = Pr[C(t = i, N(t = ], t where we use superscript c to emphasize the number c of servers in the system. The ergodicity of X(t shows that i, > 0 for all i = 0, 1,...,c and Z Mathematics Subect Classification. Primary: 68M20, 90B22; Secondary: 60K25. Key words and phrases. Multiserver retrial queue, analytical solution, minimal solution, threeterm recurrence relations, continued fractions. 431
2 432 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI In this paper, we study the stationary distribution { i, ; i = 0, 1,...,c, Z +}. Our M/M/c/c retrial queues and their variants have been studied extensively by many researchers (see a book [3], survey papers [2, 10, 13], and a list of related publications in [4]. However analytical solutions for the stationary distribution } have been obtained only in a few special cases. For the case of c = 1 (i.e., the single-server case, an explicit solution of the stationary distribution is derived in [3]. For the case of c = 2, the stationary distribution is expressed in terms of hypergeometric functions [6, 11]. Compared with the cases of c = 1, 2, the cases of c 3 are much more difficult. Under some technical assumption, Kim [9] and Gomez-Corral and Ramalhoto [5] derive analytical solutions for the M/M/3/3 retrial queue. Through the numerical experiment, Gomez-Corral and Ramalhoto [5] confirm that ergodic M/M/3/3 retrial queues satisfy the technical assumption. For any value of c = 1, 2,..., Pearce { i, [11] constructs an analytical solution for { i, continued fractions, assuming those its are all nonzero. } in terms of the its of extended The main contribution in this paper is to prove, by the method of continued fractions, that analytical solutions for { i, } in M/M/3/3 and M/M/4/4 retrial queues do not require any technical assumptions such as made in [5, 9, 11]. The main results are presented in Section 3, which follow some preinary results in Section 2. In Section 4, we provide a backward algorithm to compute the stationary distribution. Section 5 shows some numerical examples. Finally, Section 6 is devoted to some conclusions and future works. 2. Preinary results. This section provides some preinary results on the stationary distribution { i, ; i = 0, 1,..., c, Z +}. It is easy to see that { i, } satisfies the following balance equations. (λ + i + µ i, = λπ[c] i 1, + ( + 1µπ[c] i 1,+1 + (i + 1π[c] i+1,, (1 i = 0, 1,..., c 1, (λ + c c, = λπ[c] c 1, + ( + 1µπ[c] c 1,+1 + λπ[c] c, 1, (2 i = c, for all = 0, 1, 2,.... Let P [c] i (z (i = 0, 1,..., c denote P [c] i (z = It then follows from (1, (2 and (3 that (λ + ip [c] i (z + µz d dz P [c] i (z = λp [c] i 1 (z + µ d dz P [c] i, z. (3 i 1 [c] (z + (i + 1P i+1 (z, (4 i = 0, 1,..., c 1, (λ + cp c [c] [c] (z = λp c 1 (z + µ d dz P [c] [c] c 1 (z + λzp c (z, (5 i = c, where P [c] [c] 1 (z = (d/dzp 1 (z = 0. Using (4, we can readily prove the following result by mathematical induction.
3 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES 433 Proposition 2.1. P n [c] (z (n = 0, 1,...,c is given by n n!p n [c] (z = e n,i (z di [c] dzip 0 (z, (6 where {e n,i (z; n = 0, 1,...,c, i = 0, 1,..., n} is determined by the following recursion with e 0,0 (z = 1. ( d e n+1,i (z = (λ + ne n,i (z + µz dz e n,i(z + e n,i 1 (z ( d nλe n 1,i (z nµ dz e n,i(z + e n 1,i 1 (z, (7 where e 1,i (z = 0 (i = 0, 1,... and e n, 1 (z = 0 (n = 0, 1,.... It is easy to see from (7 that e n,i (z is written as e n,i (z = i =max(2i n,0 e n,i, z, n = 0, 1,...,c, i = 0, 1,..., n, (8 where e n,i, can be expressed in terms of given parameters λ and µ. Explicit expressions of e n,i, s (n = 0, 1, 2, 3, 4 are given in Appendix C.3. In what follows, for simplicity, we denote following is an immediate consequence of Proposition 2.1. by q[c] for = 0, 1,.... The Proposition 2.2. For the cases of c = 3 and 4, we have ( 1 1, = e 1,i,i ( i + 1 i, c = 3, 4, (9 {( 2 } 2, = 1 2 3, = 1 6 e 2,i,i ( i + 1 i {( 3 e 3,i,i ( i + 1 i c = 3, 4, {( 4 4, = 1 e 4,i,i ( i + 1 i 24 +e 4,2,0 ( + 1( e 2,1,0 ( ( 2 e 3,i,i 1 ( i + 2 i i=1 ( 3 e 4,i,i 1 ( i + 2 i i=1, c = 3, 4, (10 +1 } +1, (11 }, c = 4. (12 Proposition 2.2 shows that the stationary distribution { i, } (i = 1, 2,..., c, = 0, 1,... can be obtained through { ; = 0, 1,... }. 3. Main results. This section presents the main results in this paper Analytical solutions. Lemma 3.1. P [c] 0 (z satisfies c s [c] i (z di [c] dzip 0 (z = 0, z < 1, (13
4 434 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI where for i = 0, 1,..., c, s [c] i (z = λe c,i (z cµ c 1 n=i 1 (c 1! n! Proof. The proof of Lemma 3.1 is given in Appendix A. ( d dz e n,i(z + e n,i 1 (z. (14 Remark 3.1. It follows from (8 and (14 that s [c] i (z (i = 0, 1,...,c is given by i s [c] i (z = ( 1 i+ s [c] i, z, (15 =max(2i c 1,0 where s [c] i, can be expressed in terms of given parameters λ and µ. For c = 3 and 4, explicit expressions of s [c] i, s are written in Appendix C.3. The differential equations for P [3] [4] 0 (z and P 0 (z are given by and (s [3] 3,3 z3 s [3] 3,2 z2 d3 dz 3 P [3] 0 (z + (s[3] 2,2 z2 s [3] 2,1 z + s[3] (s [4] 4,4 z4 s [4] 4,3 z3 d4 dz 4P[4] 0 0 (z 2,0 d2 dz 2P[3] + (s [3] 1,1 z s[3] 1,0 d dz P [3] 0 (z + s[3] (z + (s[4] 3,3 z3 s [4] 3,2 z2 + s [4] 3,1 0,0 P [3] 0 z d3 dz 3 P [4] 0 (z + (s [4] 2,2 z2 s [4] 2,2 z + s[4] 2,0 d2 dz 2 P [4] 0 (z + (s [4] 1,1 z s[4] 1,0 d dz P [4] 0 (z + s[4] 0,0 P [4] 0 (z = 0 (16 (z = 0, (17 respectively. The important point here is that, for c = 3 and 4, s [c] i (z (i = 0, 1..., c is an i-th degree polynomial with less than or equal to 3 terms. This property leads to three terms recurrence relations. In what follows, let (α n (α R denote { 1, n = 0, (α n = α(α + 1 (α + n 1, n = 1, 2,.... From (3, we have P [c] 0 (z = z. (18 Substituting (18 into (16 and (17, we obtain K [c] z = 0, (19 where K [c] K [c] = is given by ( c + ( c 1 s [c] i,i ( i + 1 i i=2 s [c] i,i 2 ( i + 3 i ( c i=1 +2. s [c] i,i 1 ( + 2 i i +1
5 Note here that (19 implies that K [c] where a [c] a [c] = Lemma 3.2. and b [c] M/M/3/3 AND M/M/4/4 RETRIAL QUEUES = b[c] q[c] +1 + a[c] = 0 ( = 0, 1,... and therefore q[c] ( = 0, 1,... are given by c s[c] i,i ( i + 1 i c 1 i=2 s[c] i,i 2 ( i + 3 i a [c] =, b [c], b [c] =, = 0, 1, 2,..., (20 =, c i=1 s[c] i,i 1 ( i + 2 i. (21 c 1 i=2 s[c] i,i 2 ( i + 3 i b [c] a [c] = c λ > 1. Proof. It is clear from (21 that the numerators (resp. denominators of both a [c] and b [c] are c-th (resp. (c 1-st degree polynomials of. Thus a [c] = and b [c] =. Furthermore from (21, we have b [c] a [c] = Note here (see Appendix C.3 that s [3] 3,2 s [3] 3,3 i,i 1 ( i + 2 i c s[c] i,i ( i + 1 = s[c] i c i=1 s[c] = 3 λ > 1, s [4] 4,3 = 4 s [4] λ > 1, 4,4 c,c 1 s [c] c,c where the inequalities follow from the ergodic condition λ < c (see, e.g., pp in Falin and Templeton [3] or Choi and Kim [1]. The third equation in Lemma 3.2 implies that there exists some nonnegative integer 0 such that b [c] a[c] + 1, = 0, 0 + 1,.... (22 It follows from (20 that for any k = 0, 1, 2,..., +k = ξ[c] k, q[c] [c] k+1 + ξ k, q[c] k where the two sequences { [c] k, } and { ξ k, } are determined by k,0 = 0, ξ[c] k,1 = 1, ξ[c] k,+2 = b[c] +k ξ[c] k,+1 + a[c], = 2, 3,..., (23 +k ξ[c] k,., = 0, 1,..., (24 k,0 = 1, ξ[c] k,1 = 0, ξ[c] k,+2 = b[c] +k k,+1 + a[c] [c] +k ξ k,, = 0, 1,..., respectively. Remark 3.2. Proposition C.2 shows that If ξ[c] k, /ξ[c] k, exists, See Definition C.2. k, k, = a [c] i+k b [c] i+k 2 a [c] i+k b [c] i+k. = k, k,.
6 436 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI Lemma 3.3. k, = for all k = 0, 0 + 1,.... Proof. From (24, we have k,+2 = b [c] Thus we obtain k,+2 +k ξ[c] k,+1 + a[c] +k ξ[c] k, k,+1 k,+1 b [c] +k a [c] +k k,, = 0, 1,.... ( b [c] +k 1 k,+1 a [c] +k k, a [c] +k k,+1 a [c] +k k, ( = a [c], = 0, 1,..., (25 +k k,+1 where the second inequality is true because b [c] +k a[c] +k +1 (see (22. It follows from (25 that for i = 1, 2,..., k,i+1 k,i where we use k,0 we have a [c] i 1+k i 1 ( k,i a [c] l+k l=0 k,i 1 ( k,1 k,0 k, i 1 l=i 2 a [c] l+k i 1 = ( a [c] l+k l=0 k,i 1 k,i 2, (26 = 0 and ξ[c] k,1 = 1. Summing both sides of (26 for i = 1, 2,..., 1, k, 1 i 1 1 From (27 and Lemma 3.2, we obtain k, a [c] l+k i=1 l=0. = 2, 3,.... (27 1 i 1 a [c] l+k i=1 l=0 =. Remark 3.3. Gomez-Corral and Ramalhoto [5] derive an analytical solution for { i, }, assuming ξ [3] =. They also say that it is difficult to prove ξ [3] =. Kim [9] asserts that this it always holds for the ergodic M/M/3/3 retrial queue. However his proof contradicts q [3] = 0, which must hold for the ergodic M/M/3/3 retrial queue. Instead of ξ [3] =, we have proved Lemma 3.3. Although Lemma 3.3 does not necessarily show that ξ [3] =, the lemma is sufficient for the derivation of an analytical solution for { i, }, which is shown in Theorem 3.4 below and the subsequent discussion. Theorem 3.4. Let r [c] k r [c] k = q[c] k+1 /q[c] k for any k = 0, 1,.... We then have = a [c] i+k = b [c] i+k ξ[c] k, k,, k = 0, 1,.... (28
7 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES 437 Proof. We first show (28 for k = 0, 0 + 1,.... From Lemma 3.3 and 0 < i < 1 ( i = 0, 1,..., we have +k /ξ[c] k, = 0. It thus follows from (23 that 0 = = ξ[c] q[c] k+1 + k, k = q[c] k+1 + k. which leads to +k k, k, k, = q[c] k+1 k k, Therefore from (29 and Remark 3.2, we obtain a [c] i+k b [c] i+k k, k, = r [c] k, k = 0, 0 + 1,.... (29 = r [c] k, k = 0, 0 + 1,.... Next we show (28 for k = 0, 1,..., 0 1 by mathematical induction method. Since we have proved (28 for k = 0, we suppose that (28 is true for some k = n {1, 2,..., 0 }. From (20, we have n+1 = b[c] n 1 q[c] n + a[c] n 1 q[c] n 1. (30 Because a [c] n, b [c] n 1 0 and q[c] n > 0 for all n = 0, 1,..., dividing both sides of (30 by q n [c] and rearranging the result yields r [c] n 1 = q[c] n n 1 = a[c] n 1 b [c] n 1 q[c] n+1 q n [c] = a[c] n 1 b [c] n 1 r[c] n which shows that (28 is also true for k = n 1. = a [c] n 1 b [c] n 1 + a [c] i+n b [c] i+n = a [c] i+n 1 b [c] i+n 1 From Theorem 3.4, we can obtain the analytical solution for { i, } as follows. We have 1 = 0 k=0 r [c] k, = 1, 2,.... (31 From (31 and (9 (12, { i, } is expressed in terms of only one unknown probability, which is uniquely determined by the normalizing condition Asymptotic analysis. This subsection discusses the asymptotic behaviors of the number of customers in the orbit. The following lemma says that for any i = 0, 1,..., c, the probability i, geometrically decreases when is large. Furthermore, this lemma is also useful in the proof of the convergence of the backward algorithm presented in Section 4. Lemma 3.5. We have n,+1 n, where ρ [c] = λ/c denotes the traffic intensity. = r[c] = ρ [c], n = 0, 1...,c, c = 3, 4,,
8 438 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI Proof. Theorem 3.4 yields r [c] = b [c] a [c] r [c] +1, = 0, 0 + 1,.... (32 It follows from (22, Theorem 3.4 and Proposition C.3 that r [c] 1 for all = 0, 0 + 1,.... Thus since b [c] = (see Lemma 3.2, we have From (32 and (33, we obtain r[c] = r [c] +1 b [c] a [c] / b[c] 1 r [c] +1 /b[c] = = 0. (33 a [c] while the second equality follows from Lemma 3.2. Thus since r [c] for all = 0, 1,..., we have r [c] = ρ [c] and therefore From (9 (12 and (35, we have n, n As a result, (35 and (36 lead to n,+1 n, for all n = 1, 2,..., c. = +1 b [c] = ρ[c], (34 = +1 /π[c] > 0 = ρ [c]. (35 = e n,n,n, n = 1, 2,...,c, (36 n! n,+1 +1 ( + 1n +1 ( + 1n n n n, = ρ [c], 4. Numerical algorithm. Based on Theorem 3.4, { } can be computed using the sequence of continued fractions {r [c] k }. However, in the numerical computation (k = 0, 1,... in order to obtain {q[c] }. The following lemma says that { } is a minimal solution of (20 which can be computed by several recursive formulae. point of view, we have to compute each r [c] k Lemma 4.1. The sequence {, = 0, 1,... } is a minimal solution of the threeterm recurrence relations (20. Proof. From (23, we have Theorem 3.4 yields = ξ[c] 1 + 0, = 0, 1,.... (37 = r [c] q[c] 0 = 1 0,
9 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES 439 from which and (37 it follows that Note here that { ; = 0, 1,... } is a solution of (20 due to (24. Thus {q[c] } is a minimal solution of (20 (see Definition C.1. = 0. The normalization condition for { i, } is given by c i, = 1. From (9 (12 in Proposition 2.2, this normalizing condition is rewritten as β [c] q[c] = 1, (38 where β [c] is some c-th polynomial of which is determined from (9 (12. Remark 4.1. We can compute the minimal solution { } by starting with the two initial terms 0 and 1 = q[c] 0 r[c] 0, and then computing the terms q[c] 2, q[c] 3,..., with the recursive use of (20. However, since rounding error is inevitable in numerical calculation, we need to take this error in consideration, in particular for the calculation of the infinite sequence of { }. Suppose we start the recursive calculation with ˆ 0 and ˆ 1 instead of 0 and 1 due to the rounding error. We then obtain a solution {ˆ } of (20 which is not a minimal solution. Since {q[c] } is a minimal solution, thus /ˆq[c] = 0, according to Proposition C.1. Hence the it of the relative error is given by ˆ = ˆ 1 =. This shows that the forward algorithm using the recurrence relation (20 is numerically unstable. Gautschi [8] reports this phenomenon and suggests that the backward algorithm is numerically stable. Next, we present in detail, a backward algorithm and discuss its convergence Backward algorithm for minimal solution. The problem of computing a minimal solution of (20 for which (38 holds is extensively studied by Gautschi [8], who proposes a backward algorithm to compute the minimal solution satisfying (38 as follows.
10 440 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI For some nonnegative integer number ν, the sequences r [c] ( = ν, ν 1,...,1, 0 are computed by the following formulae. r ν [c] (ν = 0, r[c] η [c] ν (ν = 1, (ν = Note here that r [c] The sequence {η [c] 1 (ν = η [c] 1 η [c] (ν ν m=0 β[c] m η m [c] (ν b [c] a [c] (ν = η[c] (ν (ν, η[c] (ν and q[c] (ν = ν, ν 1,...,1, (39 r [c] (ν, = ν, ν 1,..., 1, (40 r [c] 1 (ν,, = 0, 1, 2,..., ν. (41 (ν and q[c] (ν are approximations to r[c] and, respectively. (ν} is a solution of (20 which is determined by the two consecutive terms, η ν [c] (ν = 1 and η [c] (ν = 0 (see pp in Gautschi [8]. Theorem 4.2. The backward algorithm (39 (41 converges in the sense ν q[c] (ν = q[c], = 0, 1,.... Proof. Proof of Theorem 4.2 is presented in Appendix B. We now provide a detailed algorithm to compute a finite sequence { i, }, which is an approximation to the stationary distribution { i, }. This algorithm is based on the backward recursive formulae, (39 (41 and Theorem 4.2. Input: c, λ, µ, ε. Output: ν, { i, [Begin Algorithm] ; i = 0, 1,...,c, = 0, 1,...,ν} and { p[c] Step 1. Set the initial value of ν. Step 2. Compute (ν and p[c] ; = 0, 1,..., ν}. (ν ( = 0, 1..., ν by the backward recursive formulae, (39 (41 and (9 (12, respectively, where p [c] (ν is an approximation to which denotes the probability that there are customers in the orbit in steady p [c] state. If ν ( p [c] 2 (ν + 1 p[c] (ν < ε, then go to Step 3. Otherwise, increase ν by ν := ν + 1 and return to Step 2. Step 3. Set = q[c] (ν ( = 0, 1..., ν and compute π[c] i, (i = 1, 2,..., c by formulae (9 (12 where 0, = 0 and π[c] 0,ν+2 = 0 and set [End Algorithm] p [c] = p [c] (ν, = 0, 1,..., ν.
11 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Performance measures and numerical results Performance measures. The probability that there are customers in the orbit at steady state p [c] is given by c p [c] = n,, = 0, 1, 2,.... (42 n=0 From Lemma 3.5 and (9 (12, we also have p [c] +1 = ρ [c]. (43 p [c] Let P B denote the stationary blocking probability that an arriving customer finds all the servers are occupied, which is given by P B = c,. Let E[C] and E[N] denote the average number of busy servers and the average number of retrial customers in the orbit, respectively, in steady state. We then have E[C] = c i=1 i i,, E[N] = According to Falin and Templeton [3], E[C] is explicitly given by p [c]. (44 E[C] = cρ [c] = λ. ( Numerical examples. In this section, we show some numerical examples. In all the numerical examples, we set ε = This is equivalent to increasing ν by one until at least the first ten digits of p [c] (ν ( = 0, 1...ν are the same as those of p [c] (ν + 1 ( = 0, 1...ν. Firstly, we investigate the accuracy of our algorithm. According to Falin [2, 3], the average number of busy servers is given by (45. On the other hand, the average number of busy servers can be approximately computed using (44 truncated at ν. Figure 1 presents the absolute error between the approximation of the average number of busy servers and its exact value, against the traffic intensity, with various retrial rates. It is observed that the absolute error is bounded by This shows that the algorithm can compute the average number of busy servers with high accuracy. Figure 2 describes the truncation point ν at which the algorithm stops, against the traffic intensity. It is observed that, at low traffic intensity, our algorithm stops in a few steps. However, ν is likely to increase exponentially as traffic intensity increases. In particular, when the traffic intensity approaches to 1, ν increases rapidly. Figure 3 presents the distribution of the number of customers in the orbit for the case of three servers with traffic intensities ρ [3] = 0.7, 0.9, 0.95, 0.97 and 0.99, respectively, while the retrial rate is kept constant µ = 1. It is observed that p [c] geometrically decreases when is large, according to (43. Figure 4 shows the relation between the blocking probability P B against the traffic intensity for the cases of c = 3 and 4 while keeping µ = 1. It is observed that the blocking probability increases with the traffic intensity, as expected. It is also observed that P B of the case c = 3 is larger than that of the case c = 4.
12 442 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI Absolute error e-006 1e-008 Three servers, Retrial rate = 0.01 Four servers, Retrial rate = 0.01 Three Servers, Retrial rate = 0.1 Four Servers, Retrial rate = 0.1 Three Servers, Retrial rate = 1 Four Servers, Retrial rate = 1 Three Servers, Retrial rate = 10 Four Servers, Retrial rate = 10 Three Servers, Retrial rate = 100 Four Servers, Retrial rate = e-010 1e Traffic intensity Figure 1. Absolute error E[C] λ Three servers, Retrial rate = 0.01 Four servers, Retrial rate = 0.01 Three servers, Retrial rate = 0.1 Four servers, Retrial rate = 0.1 Three servers, Retrial rate = 1 Four servers, Retrial rate = 1 Three servers, Retrial rate = 100 Four servers, Retrial rate = 100 Truncation point Traffic intensity Figure 2. Truncation point ν. Figure 5 shows the average number of customers in the orbit E[N], against traffic intensity for four cases: µ = 0.01, 0.1, 1 and 100. The average queue length of the conventional M/M/3/ and M/M/4/ queues are also plotted. It is observed that E[N] s for the four cases increase as traffic intensity increases and E[N] for a larger µ is smaller, as expected. We observe that when µ = 100, E[N] s of M/M/3/3 and M/M/4/4 retrial queues are very close to the average numbers of customers in the waiting lines of the conventional M/M/3/ and M/M/4/ queues, respectively. This implies that the average number of customers in the orbit of a retrial queue is
13 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Traffic Intensity: 0.7 Traffic Intensity: 0.9 Traffic Intensity: 0.95 Traffic Intensity: 0.98 Traffic Intensity: 0.99 Probability e-006 1e-008 1e Number of customers in the orbit Figure 3. Distribution of the number of customers in the orbit Probability e-005 1e-006 1e-007 1e-008 Three Servers, Retrial rate = 1 Four Servers, Retrial rate = 1 1e Traffic intensity Figure 4. Blocking probability. asymptotic to that of customers in the waiting line of the corresponding conventional queue, when µ tends to infinity. This agrees with the intuition and the theoretical result (see Theorem 2.5 in Falin and Templeton [3]. Figure 6 presents the standard deviation of the number of customers in the orbit against the traffic intensity keeping µ = 0.01, 0.1, 1 and 100. We observe that the standard deviation monotonically increases as traffic intensity increases. Figure 7 illustrates the impact of the retrial rate µ on the blocking probability P B, keeping ρ [c] = 0.2, 0.4 and 0.6. Note that, the horizontal lines are the probabilities
14 444 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI Average number of customers in the orbit Three servers, Retrial rate = 0.01 Four servers, Retrial rate = 0.01 Three servers, Retrial rate = 0.1 Four servers, Retrial rate = 0.1 Four servers, Retrial rate = 1 Four servers, Retrial rate = 1 Three servers, Retrial rate = 100 Four servers, Retrial rate = 100 Conventional M/M/3/Infinity Conventional M/M/4/Infinity Traffic intensity Figure 5. Average number of customers in the orbit Three servers, Retrial rate = 0.01 Four servers, Retrial rate = 0.01 Three servers, Retrial rate = 0.1 Four servers, Retrial rate = 0.1 Three servers, Retrial rate = 1 Four servers, Retrial rate = 1 Three servers, Retrial rate = 100 Four servers, Retrial rate = 100 Standard deviation Traffic intensity Figure 6. Standard deviation of the number of customers in the orbit. that arriving customers have to wait for service in the conventional M/M/3/ queueing system with the same traffic intensities 0.4 and 0.6. These probabilities are computed using Erlang C formula. It is observed that when 0.01 µ 0.1, the blocking probability is almost insensitive to the retrial rate. In the interval, 0.1 µ 100, the blocking probability slightly increases as µ increases. When the retrial rate is extremely high, 100 µ 10000, the blocking probability is insensitive to the retrial rate again. This implies that when the retrial rate µ tends to infinity, the blocking probability in the M/M/c/c retrial queue tends to the
15 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES Blocking probability 0.01 Three Servers, Traffic intensity = 0.2 Four Servers, Traffic intensity = 0.2 Three Servers, Traffic intensity = 0.4 Four Servers, Traffic intensity = 0.4 Three Servers, Traffic intensity = 0.6 Four Servers, Traffic intensity = 0.6 M/M/3/Infinity, Traffic intensity = 0.4 M/M/3/Infinity, Traffic intensity = Retrial rate Figure 7. Blocking probability against retrial rate Three Servers, Traffic intensity = 0.2 Four Servers, Traffic intensity = 0.2 Three Servers, Traffic intensity = 0.4 Four Servers, Traffic intensity = 0.4 Three Servers, Traffic intensity = 0.6 Four Servers, Traffic intensity = 0.6 Average number of customers in the orbit Retrial rate Figure 8. Average number of retrial customers against retrial rate. waiting probability in conventional M/M/c/ queue (see Theorem 2.5 in Falin and Templeton [3]. In Figure 8, we investigate the impact of retrial rate µ on the average number of customers in the orbit E[N], while keeping the traffic intensity constant, ρ [c] = 0.2, 0.4, 0.6, respectively. It is observed that E[N] monotonically decreases in the interval µ 1. This is explained as follows. When the retrial rate µ is large, the time between two consecutive retrials of a customer is short. Therefore, each retrial customer stays in the orbit for a short time, resulting in a small number
16 446 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI 1 Three servers, Retrial rate = 0.1 Three servers, Retrial rate = 1 Three servers, Retrial rate = 10 Three servers, Retrial rate = Probability 1e-006 1e-008 1e Number of customers in the orbit Figure 9. Probability distribution of the number of customers in the orbit. of customers in the orbit. It is also observed that when µ is large, E[N] is also insensitive to µ. Figure 9 illustrates the asymptotic behavior of the distribution of the number of customers in the orbit when the retrial rate tends to infinity, keeping the traffic intensity constant, ρ [3] = 0.8. We observe that not only P B and E[N], but also the probability distribution of the number of customers in the orbit is likely to have a it when the retrial rate µ tends to infinity. This agrees with the theoretical results (see Lemma 2.1 in Falin and Templeton [3]. 6. Conclusions and future works. In this paper, we have derived analytical solutions for M/M/3/3 and M/M/4/4 retrial queues without any technical assumptions which were made in previous literature. First, we have reduced the problem of finding the oint distribution of the numbers of customers in the orbit and those in service { i, } to find {π[c] } which is probability that all the servers are idle. We have derived a system of three-term recurrence relations for { } and have proved that } is a minimal solution of the three-term recurrence relations which is expressed { in terms of continued fractions. We also have presented a backward algorithm to compute the stationary distribution { i, } and have proved its convergence. Through many numerical examples, we have confirmed that the algorithm performs well even with a variety of critical situations such as, very high traffic intensities and very low retrial rates. The numerical examples have also shown that the numerical results computed by the algorithm agreed well with theoretical results. For the future works, we will find analytical solutions for retrial queueing systems with more than four servers. When the retrial queueing system has more than four servers, unfortunately, a system of three-term recurrence relations no longer exists but some higher order system of recurrence relations does. Further studies and efforts are needed to resolve this problem.
17 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES 447 Appendix A. Proof of Lemma 3.1. Proof. By summing up (4 (i = 0, 1,...,c 1 and (5 and rearranging it, we obtain ( c 1 λp [c] c (z(1 z = µ n=0 d dz P [c] n (z (1 z. (46 For z < 1, dividing both sides of (46 by (1 z/(c! yields ( c 1 λc!p c [c] c! d [c] (z = µ n!p n (z. (47 n! dz n=0 n=0 From (6 and (47, we have ( c 1 λc!p c [c] (z = µ n c! d e n,i (z di [c] n! dz dzip 0 (z c 1 = µ = µ n=0 c i=1 n+1 c! n! i=1 ( c 1 n=i 1 ( d dz e n,i(z + e n,i 1 (z d i ( c! d n! dz e n,i(z + e n,i 1 (z Using (6, the left side hand of (48 is rewritten as c λc!p c [c] (z = λ e c,i (z di dz From (48 and (49, we obtain (13 and (14. Appendix B. Proof of Theorem 4.2. [c] ip 0 [c] dzip 0 (z d i dz i P [c] 0 (z. (48 (z. (49 Proposition B.1 (Theorem 3.1 in [8]. Suppose the recurrence relation (20 has a nonvanishing minimal solution,, for which (38 holds. Let g[c] be any other solution of (38. Then the backward algorithm (39 and (41 converges in the sense if and only if ν q[c] ν g [c] (ν = q[c] (50 ν β [c] g[c] = 0. (51 Proof of Theorem 4.2. We consider a solution of (20 such that g [c] 0 = 0 and g [c] = It is clear that g [c] = 0 for all = 0, 0 + 1,.... Therefore, it follows from (26 that g [c] +1 g[c] for all = 0, 0 + 1,.... We prove that the sequence g [c] satisfies (51. We have g [c] ν β [c] g[c] = q[c] g [c] 0 β [c] g[c] + q[c] g [c] Because { } is a minimal solution of (20, we have ν g [c] 0 β [c] g[c] = 0. ν = 0+1 β [c] g[c].
18 448 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI On the other hand, ν g [c] β [c] g[c] = 0+1 q[c] ν β [c] = 0+1 g [c] g [c] According to the definition of r [c] in Theorem 3.4, = q[c] 0 ν r [c]. q[c] ν = 0+1 β [c]. (52 It follows from Lemma 3.5 that r [c] = ρ [c] < 1. Therefore, there exists some positive number ρ [c] < 1 and some nonzero natural number J( ρ [c] such that r [c] < ρ [c], = J( ρ [c], J( ρ [c] + 1,.... (53 From (52 and (53, we have J( ρ [c] 1 ( ρ [c] ν J( ρ[c] +1, ν = J( ρ [c], J( ρ [c] + 1,.... (54 q[c] 0 Because ν (54 that = 0+1 β[c] r [c] is some polynomial of ν, therefore, it follows from (52 and ν g [c] ν β [c] g[c] = 0+1 = 0. Appendix C. Recurrence relations and continued fractions. C.1. Recurrence relations and minimal solutions. Definition C.1. We consider three-term recurrence relations y n+2 = b n y n+1 + a n y n, a n 0, n = 1, 2,..., (55 where the {a n }, {b n } and {y n } are sequences on R. The set of all solutions {y n } of (55 forms a linear vector space V of dimension two over R. If there exists a non-trivial solution {h n } (i.e. h n 0 for some n and another solution {g n } of (55 such that h n = 0, n g n then {h n } is called a minimal solution of (55 [7]. Proposition C.1. For any solution {y n } of (55 not proportional to {h n }, Proof. See pp in [7]. h n = 0. n y n
19 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES 449 C.2. Basic results on continued fractions. In this section, we use the following notation to describe continued fractions. a 0 = a 0, b 0 b 0 b 0 + a 0 a 1 a 0 b 0 + a 1 b 1 = b 1 + a 2 b = a 0 b 0 + a 1 b 1, a b. a 0 b 0 + a 1 b 1 + a 2 b 2 = a 0 b 0 + a 1 b 1 + a 2 b 2, We now consider the infinite continued fraction n=0 a n b n, where the {a n ; n = 0, 1,... } is nonzero and {b n ; n = 0, 1,... } is real. Let A n and B n (n = 0, 1,... denote real numbers determined by A 0 = 1, A 1 = 0, A n+2 = b n A n+1 + a n A n, n = 0, 1,..., B 0 = 0, B 1 = 1, B n+2 = b n B n+1 + a n B n, n = 0, 1,.... Proposition C.2 (Theorem 2.1 in [7]. For any n = 2, 3,..., n 2 A n a =. B n b Definition C.2 (Definition 1.1 in [12]. If A n = γ, n B n for some finite γ, then the continued fraction n=0 a n b n is said to be convergent and its convergent value is equal to γ. Proposition C.3 (Theorem 4.35 in [7]. If b n a n +1 for all n = 0, 1,..., then n=0 where γ is some number such that γ 1. a n b n = γ, C.3. Explicit expressions of e n,i, s and s [c] i, s. This appendix provides explicit expressions of e n,i, s (n = 0, 1, 2, 3, 4 and s [c] i, s (c = 3, 4. Using (7 and (8, we
20 450 T. PHUNG-DUC, H. MASUYAMA, S. KASAHARA AND Y. TAKAHASHI can calculate e n,i, s (n = 0, 1, 2, 3, 4 as follows. e 0,0,0 = 1, e 1,0,0 = λ, e 1,1,1 = µ, e 2,0,0 = λ 2, e 2,1,0 = µ, e 2,1,1 = µ (2 λ + µ + 1, e 2,2,2 = µ 2, e 3,0,0 = λ 3, e 3,1,0 = µ (3 λ + 2 µ + 2, e 3,1,1 = µ ( 3 λ 2 + µ λµ + 3 λ + 3 µ + 2, e 3,2,1 = 3µ 2, e 3,2,2 = 3 µ 2 (λ + µ + 1, e 3,3,3 = µ 3, e 4,0,0 = λ 4, e 4,1,0 = µ (6 λ µ λµ + 8 λ + 9 µ + 6, e 4,1,1 = µ (4 λ 3 + µ λ 2 µ + 4 λµ λ µ λµ + 8 λ + 11 µ + 6, e 4,2,0 = 3 µ 2, e 4,2,1 = 2 µ 2 (6 λ + 7 µ + 7, e 4,2,2 = µ 2 (6 λ µ λµ + 12 λ + 18 µ + 11, e 4,3,2 = 6µ 3, e 4,3,3 = 2 µ 3 (2 λ + 3 µ + 3, e 4,4,4 = µ 4. Further in terms of (8, (14 and (15, s [c] i, s (c = 3, 4 are calculated as follows. s [3] 0,0 = λ4, s [3] 1,0 = µ (6 λ2 + 3 µ λµ + 8 λ + 9 µ + 6, s [3] 1,1 = λµ(3 λ2 + µ λµ + 3 λ + 3 µ + 2, s [3] 2,0 = 3µ2, s [3] 2,1 = 9 µ2 (λ + µ + 1, s [3] 2,2 = 3 λµ2 (λ + µ + 1, s [3] 3,2 = 3µ3, s [3] 3,3 = λµ3, s [4] 0,0 = λ5, s [4] 1,0 = µ (10 λ3 + 4 µ λ 2 µ + 15 λµ λ µ λµ + 30 λ + 44 µ + 24, s [4] 1,1 = λµ(4 λ3 + µ λ 2 µ + 4 λµ λ µ λµ + 8 λ + 11 µ + 6, s [4] 2,0 = 5µ2 (3 λ + 4 µ + 4, s [4] 2,1 = 2 µ2 (12 λ µ λµ + 25 λ + 36 µ + 22, s [4] 2,2 = λµ2 ( 6 λ µ λµ + 12 λ + 18 µ + 11, s [4] 3,1 = 12µ3, s [4] 3,2 = 6 µ3 (3 λ + 4 µ + 4, s [4] 3,3 = 2 λµ3 (2 λ + 3 µ + 3, s [4] 4,3 = 4µ4, s [4] 4,4 = λµ4. Acknowledgments. We would like to thank the referee very much for valuable comments and suggestions. REFERENCES [1] B. D. Choi and B. Kim, Non-ergodicity criteria for denumerable continuous time Markov processes, Operations Research Letters, 32 (2004, [2] G. I. Falin, A survey of retrial queues, Queueing Systems, 7 (1990, [3] G. I. Falin and J. G. C. Templeton, Retrial Queues, Chapman & Hall, London, [4] A. Gomez-Corral, A bibliographical guide to the analysis of retrial queues through matrix analytic techniques, Annals of Operations Research, 141 (2006,
21 M/M/3/3 AND M/M/4/4 RETRIAL QUEUES 451 [5] A. Gomez-Corral and M. F. Ramalhoto, The stationary distribution of a Markovian process arising in the theory of multiserver retrial queueing systems, Mathematical and Computer Modelling, 30 (1999, [6] T. Hanschke, Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts, Journal of Applied Probability, 24 (1987, [7] W. B. Jones and W. J. Thron, Continued Fractions: Analytic Theory and Applications, Addison-Wesley, Massachusetts, [8] W. Gautschi, Computational aspects of three-term recurrence relation, SIAM Review, 9 (1967, [9] Y. C. Kim, On M/M/3/3 retrial queueing system, Honam Mathematical Journal, 17 (1995, [10] M. F. Neuts, Numerical investigation of a multiserver retrial model, Queueing Systems, 7 (1990, [11] C. E. M. Pearce, Extended continued fractions, recurrence relations and two-dimentional Markov processes, Advances in Applied Probability, 21 (1989, [12] H. S. Wall, Analytic Theory of Continued Fractions, AMS Chelsea Publishing, Providence, Rhode Island, [13] T. Yang and J. G. C. Templeton, A survey on retrial queues, Queueing Systems, 2 (1987, Received September 2008; revised December address: tuan@sys.i.kyoto-u.ac.p address: masuyama@sys.i.kyoto-u.ac.p address: shoi@i.kyoto-u.ac.p address: takahashi@i.kyoto-u.ac.p
Retrial 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 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 informationCitation Operational Research (2012), 12(2):
TitleAn explicit solution for a tandem q Author(s) Phung-Duc, Tuan Citation Operational Research (2012), 12(2): Issue Date 2012-08 URL http://hdl.handle.net/2433/158216 RightThe final publication is available
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 informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
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 informationMARKOVIAN RETRIAL QUEUES WITH TWO WAY COMMUNICATION. Jesus R. Artalejo. Tuan Phung-Duc
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 200X Website: http://aimsciencesorg pp X XX MARKOVIAN RETRIAL QUEUES WITH TWO WAY COMMUNICATION Jesus R Artalejo Department of Statistics and
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 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 informationTwo questions on linear QBD s (quasi-birth-and-death) processes
Two questions on linear QBD s (quasi-birth-and-death) processes Florin Avram March 8, 2011 Contents 1 Quasi birth and death processes 1 2 The QBD of the linear retrial/overflow model 3 3 The factorial
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 informationM/M/1 Retrial Queueing System with N-Policy. Multiple Vacation under Non-Pre-Emtive Priority. Service by Matrix Geometric Method
Applied Mathematical Sciences, Vol. 4, 2010, no. 23, 1141 1154 M/M/1 Retrial Queueing System with N-Policy Multiple Vacation under Non-Pre-Emtive Priority Service by Matrix Geometric Method G. AYYAPPAN
More informationNon-Persistent Retrial Queueing System with Two Types of Heterogeneous Service
Global Journal of Theoretical and Applied Mathematics Sciences. ISSN 2248-9916 Volume 1, Number 2 (211), pp. 157-164 Research India Publications http://www.ripublication.com Non-Persistent Retrial Queueing
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 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 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 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 informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
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 informationQueueing Systems with Customer Abandonments and Retrials. Song Deng
Queueing Systems with Customer Abandonments and Retrials by Song Deng A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Engineering - Industrial
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 informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationON THE NON-EXISTENCE OF PRODUCT-FORM SOLUTIONS FOR QUEUEING NETWORKS WITH RETRIALS
ON THE NON-EXISTENCE OF PRODUCT-FORM SOLUTIONS FOR QUEUEING NETWORKS WITH RETRIALS J.R. ARTALEJO, Department of Statistics and Operations Research, Faculty of Mathematics, Complutense University of Madrid,
More informationAn M/M/1 Retrial Queue with Unreliable Server 1
An M/M/1 Retrial Queue with Unreliable Server 1 Nathan P. Sherman 2 and Jeffrey P. Kharoufeh 3 Department of Operational Sciences Air Force Institute of Technology Abstract We analyze an unreliable M/M/1
More informationAnalysis of an Infinite-Server Queue with Markovian Arrival Streams
Analysis of an Infinite-Server Queue with Markovian Arrival Streams Guidance Professor Associate Professor Assistant Professor Masao FUKUSHIMA Tetsuya TAKINE Nobuo YAMASHITA Hiroyuki MASUYAMA 1999 Graduate
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdlhandlenet/1887/39637 holds various files of this Leiden University dissertation Author: Smit, Laurens Title: Steady-state analysis of large scale systems : the successive
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 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 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 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 informationA Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times
Queueing Systems 48, 5 21, 2004 2004 Kluwer Academic Publishers. Manufactured in The Netherlands. A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times IVAN ATENCIA iatencia@ctima.uma.es Departamento
More informationA Two Phase Service M/G/1 Vacation Queue With General Retrial Times and Non-persistent Customers
Int. J. Open Problems Compt. Math., Vol. 3, No. 2, June 21 ISSN 1998-6262; Copyright c ICSRS Publication, 21 www.i-csrs.org A Two Phase Service M/G/1 Vacation Queue With General Retrial Times and Non-persistent
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 informationPreemptive Resume Priority Retrial Queue with. Two Classes of MAP Arrivals
Applied Mathematical Sciences, Vol. 7, 2013, no. 52, 2569-2589 HIKARI Ltd, www.m-hikari.com Preemptive Resume Priority Retrial Queue with Two Classes of MAP Arrivals M. Senthil Kumar 1, S. R. Chakravarthy
More information2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES
295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.
More informationOverload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K
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
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 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 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 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 informationAn M/G/1 Retrial Queue with Non-Persistent Customers, a Second Optional Service and Different Vacation Policies
Applied Mathematical Sciences, Vol. 4, 21, no. 4, 1967-1974 An M/G/1 Retrial Queue with Non-Persistent Customers, a Second Optional Service and Different Vacation Policies Kasturi Ramanath and K. Kalidass
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 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 information1 IEOR 4701: Continuous-Time Markov Chains
Copyright c 2006 by Karl Sigman 1 IEOR 4701: Continuous-Time Markov Chains A Markov chain in discrete time, {X n : n 0}, remains in any state for exactly one unit of time before making a transition (change
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 informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationThe Unreliable M/M/1 Retrial Queue in a Random Environment
The Unreliable M/M/1 Retrial Queue in a Random Environment James D. Cordeiro Department of Mathematics and Statistics Air Force Institute of Technology 2950 Hobson Way (AFIT/ENC) Wright Patterson AFB,
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 informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationreversed chain is ergodic and has the same equilibrium probabilities (check that π j =
Lecture 10 Networks of queues In this lecture we shall finally get around to consider what happens when queues are part of networks (which, after all, is the topic of the course). Firstly we shall need
More informationContinuous Time Markov Chains
Continuous Time Markov Chains Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 2015 Outline Introduction Continuous-Time Markov
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 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 informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationSince D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.
IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the
More informationA Simple Solution for the M/D/c Waiting Time Distribution
A Simple Solution for the M/D/c Waiting Time Distribution G.J.Franx, Universiteit van Amsterdam November 6, 998 Abstract A surprisingly simple and explicit expression for the waiting time distribution
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 informationA discrete-time Geo/G/1 retrial queue with starting failures and second optional service
Computers and Mathematics with Applications 53 (2007) 115 127 www.elsevier.com/locate/camwa A discrete-time Geo/G/1 retrial queue with starting failures and second optional service Jinting Wang, Qing Zhao
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
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 informationCalculation of Steady-State Probabilities of M/M Queues: Further Approaches. Queuing Theory and Applications (MA597)
Calculation of Steady-State Probabilities of M/M Queues: Further Approaches A assignment report submitted for the course Queuing Theory and Applications (MA597) by Ambati Narendar Reddy Roll No. 06212301
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 informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationTHE ROYAL STATISTICAL SOCIETY 2009 EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA MODULAR FORMAT MODULE 3 STOCHASTIC PROCESSES AND TIME SERIES
THE ROYAL STATISTICAL SOCIETY 9 EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA MODULAR FORMAT MODULE 3 STOCHASTIC PROCESSES AND TIME SERIES The Society provides these solutions to assist candidates preparing
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 informationPerformance Analysis of an M/M/c/N Queueing System with Balking, Reneging and Synchronous Vacations of Partial Servers
The Sixth International Symposium on Operations Research and Its Applications (ISORA 06) Xinjiang, China, August 8 12, 2006 Copyright 2006 ORSC & APORC pp. 128 143 Performance Analysis of an M/M/c/ Queueing
More informationStochastic Models 3 (1998)
CALCULATING TRANSIENT CHARACTERISTICS OF THE ERLANG LOSS MODEL BY NUMERICAL TRANSFORM INVERSION J. ABATE W. WHITT 900 Hammond Road AT&T Labs Research Ridgewood, NJ 07450-2908 Room 2C-178 Murray Hill, NJ
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
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 informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationINDEX. production, see Applications, manufacturing
INDEX Absorbing barriers, 103 Ample service, see Service, ample Analyticity, of generating functions, 100, 127 Anderson Darling (AD) test, 411 Aperiodic state, 37 Applications, 2, 3 aircraft, 3 airline
More informationSTA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008
Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There
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 informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
OPERATIONS RESEARCH Vol. 6, No. 6, November December 212, pp. 1551 1564 ISSN 3-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/1.1287/opre.112.114 212 INFORMS Stabilizing Customer Abandonment in
More informationAsymptotic study of a busy period in a retrial queue
PUB. IRMA, LILLE 2011 Vol. 71, N o VI Asymptotic study of a busy period in a retrial queue Y. Taleb a, F. Achemine a, D. Hamadouche a, A. Aissani b djhamad@mail.ummto.dz, taleb.youcef@yahoo.fr, achemine_f2001@yahoo.fr,
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
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 informationProbability and Stochastic Processes Homework Chapter 12 Solutions
Probability and Stochastic Processes Homework Chapter 1 Solutions Problem Solutions : Yates and Goodman, 1.1.1 1.1.4 1.3. 1.4.3 1.5.3 1.5.6 1.6.1 1.9.1 1.9.4 1.10.1 1.10.6 1.11.1 1.11.3 1.11.5 and 1.11.9
More informationEconomy of Scale in Multiserver Service Systems: A Retrospective. Ward Whitt. IEOR Department. Columbia University
Economy of Scale in Multiserver Service Systems: A Retrospective Ward Whitt IEOR Department Columbia University Ancient Relics A. K. Erlang (1924) On the rational determination of the number of circuits.
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 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 informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationCDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv
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 informationContents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory
Contents Preface... v 1 The Exponential Distribution and the Poisson Process... 1 1.1 Introduction... 1 1.2 The Density, the Distribution, the Tail, and the Hazard Functions... 2 1.2.1 The Hazard Function
More informationarxiv: v1 [math.pr] 11 May 2018
FCFS Parallel Service Systems and Matching Models Ivo Adan a, Igor Kleiner b,, Rhonda Righter c, Gideon Weiss b,, a Eindhoven University of Technology b Department of Statistics, The University of Haifa,
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationarxiv: v2 [math.pr] 24 Mar 2018
Exact sampling for some multi-dimensional queueing models with renewal input arxiv:1512.07284v2 [math.pr] 24 Mar 2018 Jose Blanchet Yanan Pei Karl Sigman October 9, 2018 Abstract Using a recent result
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 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 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 informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationA Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time
A Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time E. Ramesh Kumar 1, L. Poornima 2 1 Associate Professor, Department of Mathematics, CMS College of Science
More information