

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
The problem set 7 for the course ece 413 at the university of illinois for the spring 2007 semester. The problem set focuses on system reliability and cumulative distribution functions (cdfs). The assigned reading includes sections 4.9 and chapters 3 and 4. The problem set includes noncredit exercises related to 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, packet length choice for noisy channels, and a cumulative distribution function.
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


University of Illinois Spring 2007 ECE 413: Problem Set 7 Due 3/7/07 at beginning of class
Assigned reading: Section 4.9, and review Chapters 3 and the rest of Chapter 4. Noncredit exercises: Chapter 4, problems 17 and 19, theoretical exercises 17,21,22,23, and even numbered self-test problems and exercises.
5
a b
c
d
e
1 2
(^43)
The links are full duplex, meaning they can be used in both directions simultaneously, but each link is assumed to fail in a given time period with probability p = 0.001. A pair of nodes is said to be connected if they are connected by at least one path with no failed links. The network is said to be connected if all pairs of nodes are connected. Find the probabilities of the following events: (a) the network is not connected (b) exactly two links fail (c) nodes a and b are not connected (d) nodes a and c are not connected
t
2
4
5 6
7
8
1
a b
c d
3
s
Each link is assumed to fail with probability p = 0.1, independently of the other links. The network is said to fail if every directed (i.e. following the directions of the arrows) path from s to t has at least one failed link. Let Fi denote the event that link i fails, and let F denote the event the network fails. (a) Find P (F |F 1 F 2 ). (b) Find P (F |F 1 F 2 c ) and P (F |F 1 c F 2 ). (c) Find P (F |F 1 c F 2 c ). (d) Using the answers to (a)-(c), compute P (F ). (e) If instead, p = 0.001, then P (F ) is very close to 0.000002. Why is this expected? (In fact, P (F ) = 0.000002007980).