_ 34 u _ 5 H

2011 = 9 

 g g

Vol. 34 No. 5

ACTA MATHEMATICAE APPLICATAE SINICA

Sep., 2011

^TuMK_i
kXlhNRw

09M } G E 9h

hh h  h
410075)
(or|hhG}hho 236032)
(

} G E 9h

(E-mail:

09Mhh

zhmm198@sohu.com)

 h

410075)


_}  yZ&"?/
sDOk0& D0FtwmD

 /mZf5~o  /mhwm
0 /m
#_  Z
/m
2
 :

>'

Z
 :
:
ibV5~R/X
5U5~w_:
d:Ftwm D0Z/m
#
_:Z
[P/m -K ,<p Z:RC>'J5ZA
q!X'Ay
RC>'5t>'&5~U/o8+Z(6$
w?
JtR5qZo+!
%NCq~Z tRAs :/mZ M/G/1 oZ
o8+Z(6$B-
$")kn3/qBvo8Z
J
UYI f5~o
:/m
)~{:

qP

MR(2000)

oP

:

Z :

60K25; 90B22

O226

~|

 l Ap*1m p Ct\| d v T B \  4Ap5 W gv T \  G ^

j\u a t  > %j F  \ | : gv T 'i\z 'gv T B Ap ?
( \ Z 5 ( = q 7 z{  Meisling  H  *gAp ?(  . + t i
 s . u "\ m p 
3 2009 > 12  11 _ W2011 > 5  11 _ W

M=[}h9g (NO.90820302) ' 4o PoB=[}hlo6aM8 (KJ2010A253).
[1]

2
, ! # s   : /mZft R 5~o  <

907
# + &7Ap ?( d /3 ?( H  ; . + ( %j. +1YX  }\
# Y  7Ap ?( \ m p t > 1 d v T ?( 1(X 1995 ? Yang ( Li
. H  * *  Xgv T i 7Ap ?( \:9 8 ?  I W [38].
 4 gv TP l B z ' t 
 ; 1n\7Ap ?( w J  m 1
 ; &*|x2 | \T  ; s Q v1n q s < |  ; s Q uU. _
r \ ^ v T ?( s Q ;   0 
u
| ?(- Zs Q ;  A F 2 \  ; 1
nu
| ?( -  s Q ;  A F 2 \  ; 1n Fiems m p  t t
 ; 1
n\ M/G/1 Ap ?( S/ z '   7\P White ( Christie  H  *
  ; 1nv Tt ,   ,\Ap ?(  Avi-Itzhak ( Naor ^G : Ei m p 1
nv T I u   ,\Ap ?(  Federgruen ( Green s  ; 1n\Ap ?(s E
  *x i  G wz '1n d
.  L d `   ; i   G* & 8 1 P l 
;   GvexnF 2 \ 1n$ `   ; \  1n  ; N X7 T 1
Y7 V 6 x `   ; e  ;   Gvxn F 2 \ 1n$ `   ; \ 
 \ ^Q1n d
.  L d- =q\  ;  p \ P l * w J 1  \ Y0
 7 4n\w J  m 
5

[2]

[9]

[10]

[11]

[12]

gzfm

8 1 z ' u  gv T 7Ap ?( v T 8^  0 R 1 v TT ; 0 v 

(Slots). 0  vl"i 0, 1, , m, .  4 P l  \Ap 7 gaXL Y 7
 1n x x d
^iv  \ f Fxn| G  < & vxnt  { Y 0
F ~8 1 P l ?( |XL ?( (EAS), A vlkb
2 v HxnXL 7
( 1n x xuv  kbD2 v Hxn  ;-   Y 1n d
^{ Y 
 XL  I1 0 p \ D) XL # e  XL ?( v ; $. 8 F
1n;    `  x ; Vl# u   ; vl .  5 7 x YX  ;  S
^Q7\  ; 0 7 T (Orbit) \  e  ` u HXL 8 7  XL
?( 1x F  ;  D  `   ; 
7v T (&  7 T)  I1 0 r = 1 r \ D) ,A r | u  
 u  v  ;* 6 7\  )et   u  v  ;7O  ;  D  e K1
^ u   j Y  ; K  { 5 7 T 
P l  ;   G1 x Bernoulli # 1n1n) 0  = 1 |  ; 
u  v  ;* 6 1n\  )e  ; xn1n x  ) 0 F 2 \ 1n$ `  
; \  1n  ; N X7 T 1Y7 V 6 x `   ; x  ) = 1 0 
F 2 \ 1n$ `   ; \   \ ^Q1n d
.  L d- =q\
 ;   

P
i
; v T I u   ,O  , % 0 {si}
,

)7
%
0
S(x)
=
s
x
i .
i=1
i=1
F 2 \ 1nv T IjP&  ,O  , % 0u   ,\  ;  , % 0

{ri }i=1 ,  )7 % 0 R(x) =

ri xi , K n aa > r 0 n ;  F 2 \ 1nv T Ij
i=1

  f f 
34 u
&  ,O  , % 0u   ,\  ;  , % 0 {t } ,  )7 %  | T (x) =
P
t x , K n aa > r 0 .
0u L W 8 1 P l 0 < p < 1, 0 r < 1, 0 < 1, 0 1. $
~

908

i i=1

i=1

p[1 S()] + p[ S()](1 + 1 )

,
S()

K1 = + . B b\ %4 < 1 | 4 Ap ?( 5 W s \,}\  \" Y 

3

eO\Sb

v m (v  kb m \
2), ?(   #  X = {C , N , , , } #
z C #z  ; ;  (0,1,2 8 3  $s  D .% F 2 \ 1n  F 2 \
1n), N #z7 T 1    e C = 1, 2, 3, , (  $#zq
\  ; v T F 2 \ 1nv T F 2 \ 1nv T y W {X ; m 1} | 4 Ap5
W \M ,}K;   T 0
+

1,m

2,m

3,m

1,m

2,m

3,m

{(0, n) : n 0} {(1, n, i) : n 0, i 1} {(2, n, j) : n 1, j 1}

{(3, n, i, j) : n 0, i 1, j 1}.

B 3 8 1 \ m p M ,} {Xm;
0,n = lim P (Cm = 0, Nm = n),
m

m 1}

\C 6  ,

n 0,

1,n,i = lim P (Cm = 1, Nm = n, 1,m = i),

n 0, i 1,

1,n,j = lim P (Cm = 2, Nm = n, 2,m = j),

n 1, j 1,

3,n,i,j = lim P (Cm = 3, Nm = n, 1,m = i, 3,m = j),

m

n 0, i 1, j 1.

C 6 ; B?( \ Kolmogorov ~A 0

0,n =prn 0,n + prn 1,n,1 + (1 0n )prn 2,n,1 ,

n 1,

(1)

1,n,i =p1,n,i+1 + (1 0n )p1,n1,i+1 + p1,n,1 si + p(1 rn+1 )1,n+1,1 si

+ p0,n si + p(1 rn+1 )0,n+1 si + p2,n,1 si + p(1 rn+1 )2,n+1,1 si

2,n,j

n 0, i 1,
+ (1 0n )p3,n1,i,1 + p3,n,i,1 ,

X
X
=p
1,n1,i rj + (1 1n )p
2,n2,i rj
i=2

(2)

i=2

+ p2,n,j+1 + (1 1n )p2,n1,j+1 ,

n 1, j 1,

(3)

3,n,i,j =p1,n,i+1 tj + (1 0n )p1,n1,i+1 tj

+ p3,n,i,j+1 + (1 0n )p3,n1,i,j+1 ,

K1 p = 1 p.

n 0, i 1, j 1,

(4)

2
, ! # s   : /mZft R 5~o  <

909

?( $ " Y 0

0,n +

n=0

1,n,i +

i=1 n=0

2,n,j +

j=1 n=1

X
X

3,n,i,j = 1.

j=1 i=1 n=0

0 e (1)(4) y} 7 % 
0 (z) =

0,n z n ,

n=0
X

2 (y, z) =

1 (x, z) =

1,n,i z n xi ,

i=1 n=0
X
X

2,n,j z n y j ,

3 (x, y, z) =

j=1 n=1

3,n,i,j z n xi y j

j=1 i=1 n=0

(-7%
1,i (z) =

1,n,i z n ,

2,j (z) =

n=0

2,n,j z n ,

3,j (x, z) =

n=1

3,n,i,j z n xi .

i=1 n=0

 y (1)(4) & v> x z n, s n S ( Y

0 (z) =p0 (rz) + p1,1 (rz) + p2,1 (rz),
(p + pz)si
1,i (z) =(p + pz)1,i+1 (z) +
[1,1 (z) + 2,1 (z)]
z
p(z 1)si
+ (p + pz)3,i,1 (z) +
0 (z),
i 1,
z
2,j (z) =(p + pz)zrj [1 (1, z) 1,1 (z)] + (p + pz)2,j+1 (z),
3,i,j (z) =(p + pz)tj 1,i+1 (z) + (p + pz)3,i,j+1 (z),

(5)

(6)
j 1,

i 1, j 1.

(7)
(8)

 y (6)(8)  & v  $> x xi , yj ( xi yj , &   i 8 j S (

x (p + pz)
[S(x) z](p + pz)
(p + pz)
1 (x, z) =
1,1 (z) +
S(x)2,1 (z)
x
z
z
p(z 1)
+ (p + pz)3,1 (x, z) +
S(x)0 (z),
(9)
z
y (p + pz)
2 (y, z) = z(p + pz)R(y)[1 (1, z) 1,1 (z)] (p + pz)2,1 (z),
(10)
y
h
i
y (p + pz)
1 (x, z)
3 (x, y, z) = (p + pz)T (y)
1,1 (z) (p + pz)3,1 (x, z).
y
x
(11)

 (11) y1$ y = p + pz, 

h (x, z)
i
1
(p + pz)3,1 (x, z) = (p + pz)T (z)
1,1 (z) ,
x

K1 T (z) = T (p + pz).

  f f 
iy  $O (11) ( (9) y x YX
~

910

i
h (x, z)
y (p + pz)
1
3 (x, y, z) = (p + pz)[T (y) T (z)]
1,1 (z) ,
y
x
x (z)(p + pz)
S(x) z(z)
p + pz
1 (x, z) =
(p + pz)1,1 (z) +
S(x)2,1 (z)
x
z
z
p(z 1)
+
S(x)0 (z),
z

34

(12)

(13)

(z) = + T (z).
 (13) y1$ x = 1 &O (10) y

y (p + pz)
p(1 z)R(y)
[R(y) + (z)](p + pz) 1
2 (y, z) =
1,1 (z) +
2,1 (z)
y(p + pz)
1 (z)(p + pz)
1 (z)(p + pz)
R(y)p(z 1)
+
0 (z).
(14)
1 (z)(p + pz)

 (13) ( (14) y1 $$ x = (z)(p + pz) ( y = p + pz,

[S (z) z(z)](p + pz)1,1 (z) + (p + pz)S (z)2,1 (z)
=p(1 z)S (z)0 (z),

(15)



p(1 z)R (z)1,1 (z) + [R (z) + (z)](p + pz) 1 2,1 (z)

=p(1 z)R (z)0 (z),

(16)

K1 R (z) = R(p + pz), S (z) = S((z)(p + pz)).

 (15), (16) y x YX

p(1 z)[1 (z)(p + pz)]S (z)

0 (z),
(p + pz)D(z)
p(1 z)z[(z)(p + pz) S (z)]R (z)
2,1 (z) =
0 (z),
(p + pz)D(z)
1,1 (z) =

(17)
(18)

K1
D(z) = z(z)(p + pz)[R (z) + (z)] S (z)[zR (z) + (z)(p + pz) 1] z(z).

B 3 8 1 C  D  }

` 1

(1)

s 0 < z < 1, *^y

z(z)(p + pz)[R (z) + (z)] S (z)[zR (z) + (z)(p + pz) 1] z(z)

=TO h T =
(2) T < 1, = G lim

p[1S()]+p[S()](1 +1 )
S()
1z
z1 D(z)

lim

z1

KO

< 1.

1z
1
=
.
D(z)
S() p[1 S()] p[ S()](1 + 1 )

2
, ! # s   : /mZft R 5~o  <

8 1-%4 d * (1), d * (2)   (1) y Yz ' % 
f (z) = z(p + pz)[R (z) + (z)]

E \ f (1) = 1,

911

S (z)[zR (z) + (z)(p + pz) 1]

.
(z)

O` yn % f (z) - f (z) > 0, f (z) > 0, z [0, 1), s

0 z < 1, *^y f (z) > z =TO h T f (1) < 1.
 f (1) = 1 + p + p( + )
, lU R H   &*
< 1. %
^y f (1) < 1 ^ Q  =
(z) ( (z)  $O (13) ( (14) yY

f (0) > 0,

S ()(p1 +p1 ++p)

1
1

p[1S()]+p[S()](1 +1 )
S()

1,1

2,1

S(x) S (z) xp(1 z)(z)[1 (z)(p + pz)]

0 (z),
x (z)(p + pz)
D(z)
R(y) R (z) yp(1 z)z[(z)(p + pz) S (z)]
2 (y, z) =
0 (z).
y (p + pz)
D(z)

1 (x, z) =

 (x, z) (

1,1 (z)

O (12) yY

3 (x, y, z)
=

T (y) T (z) (z)(p + pz)S(x) xS (z) yp(1 z)[1 (z)(p + pz)]

0 (z).
y (p + pz)
x (z)(p + pz)
D(z)

\.

1,1 (rz)

(19)

( 2,1(rz) O (5) y
0 (z) =p

n [1 (rz)(p + prz)][S (rz) rz(rz)(p + prz)]

(p + prz)D(rz)
rzR (rz)[(rz)(p + prz) S (rz)] o
+
0 (rz)
(p + prz)D(rz)
=G(rz)0 (rz).

(20)

 (20) y j Y eO 8 1  x YX
0 (z) = 0 (0)

` 2 e < 1,  9 Q> < Q

C G(z) T = B 3\ X y

k=1

G(rk z).

(21)

k=1

G(rk z)



G(z) = 1 + F (z).

F (z) = pz

[1 (z)(p + pz) zR (z)][(z)(p + pz) S (z)]

.
(p + pz)D(z)

 } 1 &e < 1, s 0 < z < 1, F (z) > 0. |

k=1

G(rk z) =

k=1

[1 + F (rk z)],

(22)

912

 f f

34

u (22) y1 9 Q> < Q G(r z)
\^ Q " Y | C  P F (r z)


k=1

k=1

F (rk+1 z)
= r < 1,
k F (rk z)
lim

 } 2 Y%
$ " Y 0(1) + 1(1, 1) + 2(1, 1) + 3(1, 1, 1) = 1, Y
0 (1) = 1

p[1 S()] + p[ S()](1 + 1 )

= 1 .
S()

(1) O (21) yY

0

hY
i1
0 (0) = (1 )
G(rk )
.
k=1

?i8 1  x YXa B f 
L` 1 e < 1, M ,} {X

m,

m N}

\C 6  , a B  )7 % 

Q
G(rk z)
n
o
p[1 S()] + p[ S()](1 + 1 ) k=1
0 (z) = 1
,

Q
S()
G(rk )
k=1

S(x) S (z) xp(1 z)(z)[1 (z)(p + pz)]

0 (z),
1 (x, z) =
x (z)(p + pz)
D(z)
R(y) R (z) yp(1 z)z[(z)(p + pz) S (z)]
2 (y, z) =
0 (z),
y (p + pz)
D(z)
3 (x, y, z) =

T (y) T (z) (z)(p + pz)S(x) xS (z) yp(1 z)[1 (z)(p + pz)]

0 (z).
y (p + pz)
x (z)(p + pz)
D(z)

sd 1
(1)
(2)

?( F 6B 
 ; F D v7 T   \ J 7 % 0 0(z).
 ; F.%v7 T   \ J 7 % 0
1 (1, z) =

(3)

 ; FF 2 \ 1nv7 T   \ J 7 % 0
2 (1, z) =

(4)

p(1 z)(z)[1 S (z)]

0 (z).
D(z)

z[1 R (z)][(z)(p + pz) S (z)]

0 (z).
D(z)

 ; F  F 2 \ 1nv7 T   \ J 7 % 0
3 (1, 1, z) =

[1 T (z)][(z)(p + pz) S (z)]

0 (z).
D(z)

H
(5)

2
, ! # s   : /mZft R 5~o  <

7 T 1    (N ) \7 % 0

913

(z) =0 (z) + 1 (1, z) + 2 (1, z) + 3 (1, 1, z)

=
(6)

(1 z){S (z) + p(1 z)(z) + [1 T (z)](z)(p + pz)}

0 (z).
D(z)

"  ?( 1    (L) \7 % 0

(z) = 0 (z) + z1 (1, z) + 2 (1, z) + z3 (1, 1, z) =

sd 2

(1)

6B  ; F D

0 (1) = 1 ,
2 (1, 1) =
(2)

p1 [ S()]
,
S()

(1 z)[1 (z)(p + pz)]S (z)

0 (z).
D(z)

. F 2 \ 1n ( F 2 \ 1n\  )  $
1 (1, 1) =

p[1 S()]
,
S()

3 (1, 1, 1) =

p1 [ S()]
.
S()

7 T 1C w  0

E(N ) =

p[S ()(1 + ) (1 + 1 )] p2 [ S()](2 + 2 )

+
S()
2(1 )S()
p(1 + 1 )[p( + 1 )(1 S ()) + ]
p( + p1 )
+
(1 )S()
(1 )S()

p(1 + p1 )S() pS ()( + 1 )( + p) X G (rk ) k

+
r .
(1 )S()
(1 )S()
G(rk )

k=1

(3)

?( C w p: 0
E(L) = E(N ) +

a{jWxpJVx

p1 [ S()]
.
S()

 b 8 1 \ m pt 
 ; 1n\gv T 7Ap ?( K H s \ d v
T Ap ?( \  ? 0 G\ v T 8^  0 T+ O \vl* I 0 .
z ' d v T B t 
 ; 1n\ M/G/1 7Ap ?(  XL #   I1
0 \ Poisson # H !\7 T v T b j I1 0 \ ,   ,
 \  ; v T 0 ^ z  ,\  ; K  , % 0 B(x), H \G  -  a
 3 (LST) 0 (s); ?( -   ; v T xn1n1n) 0 , e  ; xn1n
 x  ) 0 F 2 \ 1n$ `   ; \  1n  ; N X7 T 1Y7 V 6
 x `   ; x  ) = 1 0  F 2 \ 1n$ `   ; \   \ ^Q1n d

.  L d- =q\  ; F 2 \   F 2 \ 1nv Tw I u   ,K  , %

~   f f 
34 u
  $ 0 Bd (x) ( Bn (x), H \G  -  a  3 (LST) 0 d (s) ( n (x), k a
a > r 0 kd , kn, k = 1, 2.
T B  O v d v T gv T Ap ?( \1  a B k   ?
914

p = ,
Z i
si =

r = 1 ,

= ,
Z i
ri =
dBd (x),

dB(x),

(i1)

(i1)

ti =

dBn (x),

i 1.

(i1)

B 3 8 1 \ D d v Tt 
 ; 1n\ M/G/1 7Ap ?( 1    \
 )7 %  0
lim (z).  < f { *:%4 a B d!
lim p1 = 1d ,

lim p1 = 1n ,

lim R (z) = d ((1 z)) = d (z),

lim =

lim S (z) = (h(z)) = (z),

lim T (z) = n ((1 z)) = n (z),

[1 ()](1 + 1d + 1n )
,
()

K1 h(z) = ((1 z)) + (1 z).

 (20) y8 1
n

d
0 (z) 0 (rz)
F (rz)
0 (z) = lim
= lim
0 (rz).
0
0 (1 r)z
dz
z rz

[1 (h(z))][h(z) zd ((1 z))]

F (rz)
=
,
0 (1 r)z
[1 (h(z))]zd ((1 z)) [z (h(z))]h(z)
lim

x T 0 v

[1 (h(z))][h(z) zd ((1 z))]

0 (z) =
0 (z).
dz
[1 (h(z))]zd ((1 z)) [z (h(z))]h(z)
0

ve G /  ~Y

0 (z) 0 (1) exp

n Z

o
[1 (h(u))][h(u) ud ((1 u))]
du .
[1 (h(u))]ud ((1 u)) [u (h(u))]h(u)

Iu  Y
(1 z)h(z)(h(z))
[1 (h(z))]zd ((1 z)) [z (h(z))]h(z)
n Z z
o
[1 (h(u))][h(u) ud ((1 u))]
exp
du .
1 [1 (h(u))]ud ((1 u)) [u (h(u))]h(u)

lim (z) =(1 )

d! (BzYX\ d v Tt 
 ; 1n\ M/G/1 7Ap ?(
1    \  )7 %  | u .\

2
, ! # s   : /mZft R 5~o  <

915

n Qv

 b\ D D  *    3 ?( 1  s D  ) ( 7 T C w  \

 L 0 GP l  ; v T I1 0 s = 1 s \ D) ,K7 % 0 S(x) =
.
F 2 \ ( F 2 \ 1nv T $  I v N  ,s \7 %   $ 0
sx
1sx

R(x) =

 2x n1
,
5 3x

T (x) =

 2x n2
,
3x

A F 2 \ ( F 2 \ 1nv T $ 0 n1 ( n2 D) , (w *  $ 0 2.5 ( 1.5) \j

  ; \ ( xB)X 1  W* w - ?(6 f " Y 
1

1
=0.4
=0.6
=0.8

0.9
0.8

=0.2
=0.6
=1

0.9
0.8

p=0.2

p=0.2

0.7

0.7
=0.6

=0.6
0.6

1=2.5

0.5

(1)

(1)

0.6

1=1.5

0.4

0.4

0.3

0.3

0.2

0.2

0.1

0.1

0.1

0.2

0.3

0.4
s

0.5

0.6

0.7

0.8

1=2.5

0.5

1=1.5

0.1

0.2

0.3

(a)

0.4
s

0.5

0.6

0.7

0.8

(b)

r 1 s r (1) [K (a) 0 [K (b) 0 [K

 ) 1(a),(b) 18 1  $ m p 1  , x  s s  ; F D ;   )\
L $a  I (1)  < s \Nu V O # u ~3 (1)  $  1  ( \ V
O uN
0

100

100

80
70

80
70
60

50

50

40

40

30

30

20

20

10
0

=0.2
=0.4
=1

p=0.2
=0.6
1=2.5
2=1.5
=1.5
1
=1.5
2
r=0.95

90

E(N)

60
E(N)

=0.4
=0.6
=0.8

p=0.2
=0.6
1=2.5
2=1.5
=1.5
1
=1.5
2
r=0.95

90

10
0

0.1

0.2

0.3

0.4
s

(a)

0.5

0.6

0.7

0.8

0.1

0.2

0.3

0.4
s

(b)

r 2 s r E(N ) [K (a) 0 [K (b) 0 [K

0.5

0.6

0.7

0.8

~   f f 
34 u
) 2, ) 3  $  D1  , , F 2 \ v T( F 2 \ v T s7 T C w 
E(N ) \ L T1  W* & *v E(N ) w 0 s \ %  # +  E(N )  $  <
1  , ,n1 ( n2 \ N u N  S i|w J u .\&O 8 1  x  3XT1
 \W* `k 6 f " Y  f v7 T \C w  E(N ) Txg
916

90

90
n1=1
p=0.2
=0.6
=0.6
=1.5
1
=1.5

80
70
60

n2=1
p=0.2
=0.6
=0.6
=2.5
1
=7.5

80

n1=2
n =3
1

70
60

E(N)

E(N)

r=0.95

40

30

30

20

20

10

10

0.1

50

40

n =3

r=0.95
50

n2=2

0.2

0.3

0.4
s

0.5

0.6

0.7

0.8

0.1

0.2

0.3

(a)

0.4
s

0.5

0.6

0.7

0.8

(b)

r 3 s r E(N ) [K (a) E1[uS[K (b)
E1[uS[K

H [ t y
[1] Meisling T. Discrete Time Queueing Theory. Oper. Res., 1958,6: 96105
[2] Yang T, Li H. On the Steady-state Queue Size Distribution of the Discrete-time Geo/G/1 Queue with
Repeated Customers. Queueing Systems, 1995, 21: 199215
[3] Falin G I, Templeton J G C. Retrial Queues. London: Chapman Hall, 1997
[4] Atencia I, Moreno P. A Discrete-time Retrial Queue with Server Breakdown. Asia-Pacific Journal
of Operational Research, 2006, l32(2): 247271
[5] Atencia I, Moreno P. A Discrete-time Geo/G/1 Retrial Queue with General Retrial Times. Queueing
Systems, 2004, 48: 521
[6] Atencia I, Moreno P. The Discrete-time Geo/Geo/1 Queue with Negative Customers and Disasters.
Computers and Operations Research, 2004, 31: 15371548
[7] Atencia I, Moreno P. A Discrete-time Geo/G/1 Retrial Queue with the Server Subject to Starting
Failures. Annals of Operation Research, 2006, 141(1): 85107
[8] Nathan P. Sherman, Jeffrey P. Kharoufeh. An M/M/1 Retrial Queue with Unliable Server. Operations
Research Letters, 2006, 34: 697705
[9] Fiems D, Maertens T, Bruneel H. Queueing Systems with Different Types of Server Interruptions.
European Journal of Operational Research, 2008, 188: 838845
[10] White H, Christie L. Queuing with Preemptive Priorities or with Breakdown. Operations Research,
1958, 6(1): 7995

2
, ! # s   : /mZft R 5~o  <

[11] Avi-Itzhak B, Naor P.

917

Some Queuing Problems with the Service Station Subject to Breakdown.

Operations Research, 1963, 11(3): 303319

[12] Federgruen A, Green L. Queueing Systems with Service Interruptions.

Operations Research, 1986,

34(5): 752768

A Discrete-time Retrial Queue with Two Types

of Server Interruptions
ZHANG Mian
(Department

of Mathematics, Central South University, Changsha 410075)

(Department

of Mathematics, Fuyang Normal College, Fuyang 326032)

(E-mail:

zhmm198@sohu.com)

HOU Zhenting
(Department
Abstract

of Mathematics, Central South University, Changsha 410075)

We consider a discrete queueing system with disruptive and non-disruptive

server interruptions. Both disruptive and non-disruptive interruptions may start when there
is a customer in service. If a disruptive interruption occur, the customer is obliged to join
the orbit; Otherwise, if a non-disruptive interruption occur, the customer waits and continues its service after a non-disruptive interruption. We analyze the equilibrium distribution
of the system and obtain the generating functions of the limiting distribution. Moreover,
we prover that M/G/1 retrial queue with two types of server interruptions. Finally, some
numerical examples are presented.
Key words

discrete-time retrial queue; server interruptions; unreliable server

MR(2000) Subject Classification 60K25; 90B22

Chinese Library Classification O226