Bagian IV
MA 4272 Kapita Selekta Matematika Terapan II:
Teori Antrian
Rieske Hadianti
Tugas
Communication network
Consider a communication link with a constant rate of 4.8kbit per
ec. Over the link we transmit two types of messages, both of
exponentially distributed size. Messages arrive in a Poisson fashion
with λ = 10 messages/second. With probability 0.5 (independent
from previous arrivals) the arriving message is of type 1 and has a
mean length of 300 bits. Otherwise a message of type 2 arrives
with a mean length of 150 bits. The buffer at the link can at most
hold one message of type 1 or two messages of type 2. A message
being transmitted still takes a place in the buffer.
1 Determine the mean and the coefficient of variation of the
service time of a randomly chosen arriving message.
2 Determine the average times in the system for accepted
messages of type 1 and 2.
3 Determine the message loss probabilities for messages of type
Rieske Hadianti
1 and 2.Consider a communication Program link with a constant rate
Studi MatematikaInstitut Teknologi Bandung
of 4:8kbit=sec.
Bagian IV MA 4272 Over
Kapita Selekta Matematika theII:link
Terapan we transmit two types of
Teori Antrian
SoalMarkovianQS M/G /1 GI /M/1 BulkArr BulkServ
E [waktu pelayanan]
ρ= = λE [Sn ].
E [waktu antar kedatangan ]
Peluang transisi
0,
j <i −1
Pij =
R ∞ e −λx (λx)j−i+1 dG (x), j = i − 1, i, i + 1, · · · .
0 (j−i+1)!
Distribusi stasioner
Misalkan πj = limn→∞ Pijn . Dari balance equations
(π0 π1 π2 · · · ) = (π0 π1 π2 · · · )P kita dapatkan
∞
X
πj = πi Pij
i=0
j+1
X
= πi Pij
i=0
∞
(λx)j
Z
= π0 e −λx dG (x)
0 j!
j+1 ∞
(λx)j−i+1
X Z
+ πi e −λx dG (x)
0 (j − i + 1)!
i=1
∞ ∞ ∞
(λx)j
X X Z
πj z j
= π0 z j
e −λx dG (x)
0 j!
j=0 j=0
∞ j+1 ∞
(λx)j−i+1
X X Z
+ z j
πi e −λx dG (x)
0 (j − i + 1)!
j=0 i=1
∞ ∞
(λx)j
Z X
= π0 e −λx zj dG (x)
0 j!
j=0
∞ ∞ j+1
(λx)j−i+1
Z X X
−λx j
+ e z πi dG (x)
0 (j − i + 1)!
j=0 i=1
∞
X Z ∞
πj z j
= π0 e −λx e zλx dG (x)
j=0 0
∞ ∞ j+1
(λx)j−i+1
Z X X
+ e −λx zj πi dG (x)
0 (j − i + 1)!
j=0 i=1
Z ∞
= π0 e −λx e zλx dG (x)
0
∞ ∞ ∞
(λx)j−i+1
Z X X
−λx
+ e πi zj dG (x)
0 (j − i + 1)!
i=1 j=i−1
∞
X 1
= π0 B(λx(1 − z)) + πi z i B(λx(1 − z))
z
i=1
∞
X (z − 1)B(λx(1 − z))
πj z j = π0 .
z − B(λx(1 − z))
j=0
R∞
B(λx(1 − z)) = 0 e −λx(1−z) dG (x)
R∞
Jika z ↑ 1, limz↑1 B(λx(1 − z)) = B(0) = 0 dG (x) = 1.
Jika z ↑ 1, limz↑1 B(λx(1 − z)) = B 0 (0) = −E [Sn ].
π0 dapat diperoleh dengan cara mencari limit dari generating
function untuk z ↑ 1.
π0 = 1 − λE [Sn ] = 1 − ρ.
Penentuan E [R]
λE [S ] 2
τ = W + E [S] = 2(1−ρ)) + E [S]
λE [S 2 ]
L = λτ = λ 2(1−ρ)) + E [S]
λE [S 2 ]
Lq = λW = λ 2(1−ρ)) + E [S]
Sistem M/D/1
E [waktu pelayanan] 1
ρ= = .
E [waktu antar kedatangan ] µE [An ]
Xn+1 = Xn + 1 − Zn+1 .
R
∞ −µx
Pi (µx)k
0 1 − e k=0 k! dF (x), j = 0
Pij = R ∞ −µx (µx)i+1−j
e (i+1−j)! dF (x), j = 1, · · · , i + 1
0
0, j = i + 2, i + 3, · · ·
πj = (1 − z1 )z1j .
∞ ∞
(µx)i+1−j
X Z
(1 − z1 )z1 = i
(1 − z1 )z1 e −µx dF (x)
0 (i + 1 − j)!
i=0
Z ∞
= (1 − z1 ) e −µx e z1 µt dF (x)
0
= (1 − z1 )A(µ(1 − z1 )).
z1 = A(µ(1 − z1 )).
Dengan Teoreman Nilai Antara kita tahu bahwa f (z) memiliki akar
di antara 0 dan 1.
∞
X
τ = E [sojourn time seorang pelanggan|saat
j=0
λp0 = µp1
n
X
(λ + µ)pn = µpn+1 + λ pn−k ck , n ≥ 1.
k=1
P∞ j,
P∞ j,
Definisikan P(x) = j=0 pj x C (x) = j=0 cj x |x| < 1
Buktikan:
p0 µ(1 − x)
P(x) = , |x| < 1.
µ(1 − x) − λx(1 − C (x))
b n ) = pn+1 . Untuk n ≥ 1,
Definisikan operator P(p
b K +1 − (λ + µ)P
[µP b + λ](pn ) = 0.
K
X +1
pn = Ci rin ,
i=1
Latihan
1 Tunjukkan bahwa p0 = 1 − r0 .
2 Tunjukkan bahwa pn = (1 − r0 )r0n , n ≥ 1.
r0
3 Tunjukkan bahwa L = 1−r0 .