

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Solutions to problem set 7 of the university of illinois ece 413 course, focusing on the reliability of multiple connections, failure rate function for discrete random variables, reliability of a self-healing ring communication network, network reliability problem, a series parallel network, and packet length choice for noisy channels.
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


University of Illinois Spring 2007 ECE 413: Solutions to Problem Set 7
λT (1) = pT (1). Note that λT (k) is only well defined if P (T ≥ k) > 0 .) (b) By definition, λT (kf ) = 1 if and only P (T = kf ) = P (T ≥ kf ) > 0. So λT (kf ) = 1 if and only if P (T > kf ) = P (T ≥ kf ) − P (T = kf ) = 0 and P (T = kf ) > 0. Thus, the condition λT (kf ) = 1 means that T has a largest possible value, and that value is kf.
(c) For 1 ≤ k ≤ n, λT (k) = (^1) −PpkT−^ ( 1 k) l=1 pT^ (l)^
1 n 1 − k− n^1 =^
1 n−k+1. (That is, the first^ n^ values of^ λT^ are 1 n ,^
1 n− 1 ,... ,^
1 1 .) (d) One solution is to first derive a general formula. Note that
P (T ≥ k + 1) = P ({T ≥ k + 1} ∩ {T ≥ k}) = P (T ≥ k + 1|T ≥ k)P (T ≥ k) = (1 − P (T = k|T ≥ k))P (T ≥ k) = (1 − λT (k))P (T ≥ k) (1)
Starting with the initial condition P (T ≥ 1) = 1, (1) can be used to solve for P (T ≥ k) for all k. The result is P (T ≥ k) = (1 − λT (1))(1 − λ 2 (T )) · · · (1 − λT (k − 1)) for k ≥ 1. Therefore,
P (T = k) = P ({T ≥ k} ∩ {T = k}) = P (T ≥ k)P (T = k|T ≥ k) = P (T ≥ k)λT (k) = (1 − λT (1)) · · · (1 − λT (k − 1))λT (k).
In particular, if λT (k) = p for all k ≥ 1, then pT (k) = (1 − p)k−^1 p for k ≥ 1. In other words, T has the geometric distribution with parameter p. (e) Fix k ≥ 0. Consider conditional probabilities given the event {T ≥ k}. Equivalently, consider conditional probabilities given that both links are still working at time k. Then the conditional probability that the network fails at time k, is the conditional probability that the first link fails at time k, plus the conditional probability that the second link fails at time k, minus the conditional probability that both links fail at time k. That is λT (k) = λ 1 (k) + λ 2 (k) − λ 1 (k)λ 2 (k). (Note: If λ 1 (k) and λ 2 (k) are both very small, then λT (k) ≈ λ 1 (k) + λ 2 (k). )
(d) At least one of links 1 or 2 must fail, and at least one of links 3,4, or 5 must fail, which has probabilty [1 − q^2 ][1 − q^3 ] ≈ 0. 000006. (Note, on a logarithm scale, the answers to parts (a)-(d) are all about the same.)
6
(b) (^) (c)
6
7
8
b
c d
t
7
8
b
d
t
s
5 s^ a c
3
4
5
(c) Given the event F 1 c F 2 c , the original network is equivalent to the one pictured. Nodes s, a, and c are merged, because a and c can always be reached from s. Analysis of the equivalent network yields P (F |F 1 c F 2 c ) = (p^2 + p − p^3 )^2 = 0. 011881. (d) P (F ) = p^2 P (F |F 1 F 2 ) + pqP (F |F 1 F 2 c ) + pqP (F |F 1 c F 2 ) + q^2 P (F |F 1 c F 2 c ) = 0.0261. (e) The network is tolerant to single link failures, and there are only two possible double link failures that can make the network fail, namely F 1 F 2 and F 7 F 8. It is much more likely that either of these two events occurs than it is that three or more links will fail in this small network, for p = 0. 001. Thus, for p = 0.001, P (F ) ≈ P (F 1 F 2 ∪ F 7 F 8 ) ≈ P (F 1 F 2 ) + P (F 7 F 8 ) = 0. 000002.
P (F 1 |F ) =
(b)
P (F 2 |F ) =