DOC PREVIEW
UT Dallas CS 6385 - PROJECT3(1)

This preview shows page 1 out of 3 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Project 3The theme of the project is to study experimentally how the network reli-ability depends on the individual link reliabilities, in the specific situationdescribed below.Network topology: A complete graph on n = 5 nodes. This means, everynode is connected with every other one (parallel edges and self-loops are ex-cluded in this graph). As a result, this graph has m = 10 edges, representingthe links of the network.Components that may fail: The links of the network may fail, the nodesare always up. The reliability of each link is p, the same for every link. Theparameter p will take different values in the experiments.Reliability configuration: The system is considered operational, if thenetwork topology is connected.Specific tasks:1. Create an algorithm to compute the network reliability in the abovedescribed situation, using the method of exhaustive enumeration (seein the Lecture Notes). Note that the high level description given in thenotes is not enough, since you also have to specify how you actuallywant to find the details, such as how to generate the possible states,how to assign an up/down system condition to each, how to convert itinto a reliability value, etc.IMPORTANT: Finding an algorithmic solution for these de-tails is part of the task!Describe how your algorithm works. First briefly explain informally theideas. Then provide pseudo code for the description of the algorithm,with sufficient comments to make them readable and understandableby a human.2. Write a computer program that implements the algorithm You mayuse any programming language under any operating system, this is1entirely of your choice. Make sure, however, that your program is wellstructured to support finding potential errors (debugging), checkingcorrectness or trying out algorithm changes. Explain how your programsupports these goals.3. Run the program for different values of p. Let the parameter p run overthe [0, 1] interval, in steps of 0.02. Show graphically in a diagram howthe obtained network reliability values depend on p.4. Now fix the p parameter at p = 0.9, and do the following experiment.Among the 210= 1024 possible combinations of component states pickk of the combinations randomly, and flip the corresponding systemcondition. That is, if the system was up, change it to down, if itwas down, change it to up. Show in a diagram, how the reliability ofthe system changes due to this alteration. Specifically, show how thechange depends on k, in the range k = 0, 1, 2, 3, . . . , 100. During thisexperiment keep the value of the parameter p fixed at p = 0.9. Toreduce the effect of randomness, run several experiments and averagethem out. for any given value of k.5. Provide a 1-2 paragraph explanation why the obtained diagrams lookthe way they look. In other words, try to argue that they exhibit thebehavior that one could intuitively expect, so the program is likely towork correctly.Note: If something is not specified in this project description, that means itis left to your choice.Submission guidelinesDescribe everything, including verbal description, pseudo code, program, in-put/output data, experimental results, figures, conclusions, in a single doc-ument. Submit it through eLearning. Do not submit executable code, butinclude the source code as an Appendix in the document. Note: your sub-mission will be read as a document and not run as a program (but there aretwo exceptions, see them under Evaluation).2Remark: It might be helpful to think about the whole project that yourtask is not only to solve the technical problem, but you also have to “sell”the results. Try to look at your work from the viewpoint of a potential“customer”: how convincing your presentation would look for a customer?EvaluationThe evaluation will focus on how well each of the specific tasks have beencarried out. Even though the submission will not be run, only read as adocument, there are two exceptions. You will be asked to demonstrate ona computer how your program actually runs, if any of the following casesoccur:1. You do not agree with the grade and want to improve it. In this casethe demonstration should show that your work is actually better thanthe received grade.2. There is suspicion that the work is not original or not individually doneor the results were not produced by your own correctly running pro-gram. In this case a demonstration is required to clarify the situationand to receive any score.Note:The work should be fully individual and original. Any form of cheating is aserious violation of University policies and can lead to serious


View Full Document

UT Dallas CS 6385 - PROJECT3(1)

Documents in this Course
assn1

assn1

2 pages

38rel2

38rel2

5 pages

Report

Report

3 pages

networks

networks

18 pages

lp2

lp2

44 pages

lp2 (2)

lp2 (2)

27 pages

lp1(1)

lp1(1)

21 pages

integer1

integer1

50 pages

FrankR2

FrankR2

3 pages

duality

duality

28 pages

CMST

CMST

44 pages

hw4

hw4

3 pages

for 1

for 1

11 pages

ENCh02

ENCh02

33 pages

pree

pree

2 pages

new  3

new 3

2 pages

new  2

new 2

2 pages

hw4a

hw4a

2 pages

T2_Sol

T2_Sol

4 pages

ISM3

ISM3

8 pages

hw4_sol

hw4_sol

6 pages

Elm04_06

Elm04_06

11 pages

atn proj2

atn proj2

20 pages

12CUT1

12CUT1

8 pages

09Ford

09Ford

23 pages

08FLOW

08FLOW

6 pages

03LP_su

03LP_su

6 pages

40REL40

40REL40

5 pages

39rel3

39rel3

5 pages

38arel2

38arel2

5 pages

37REL1

37REL1

3 pages

24TABU

24TABU

3 pages

22DYNPR

22DYNPR

3 pages

21B&C

21B&C

2 pages

20BBEX0

20BBEX0

3 pages

19BB

19BB

5 pages

14CAPBUD0

14CAPBUD0

11 pages

35BRXCH

35BRXCH

2 pages

34COMB

34COMB

4 pages

32CAPAS

32CAPAS

4 pages

31QUEUE

31QUEUE

3 pages

Load more
Download PROJECT3(1)
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view PROJECT3(1) and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view PROJECT3(1) 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?