Loading...
Please wait, while we are loading the content...
Similar Documents
Implementing an Approximation Scheme for All Terminal Network Reliability
| Content Provider | Semantic Scholar |
|---|---|
| Copyright Year | 2007 |
| Abstract | In this thesis, I implemented a randomized fully polynomial time approximation scheme for the All Terminal Network Reliability Problem. The scheme consists of a combination of a naive Monte Carlo algorithm for computing the reliability of networks with a high failure probability, and a method of enumerating small cuts to compute the the reliability of networks with a small failure probability. The implementation was tested on several different network topologies. The implementation demonstrated chat the algorithm performed better than its theoretical O(n 1 ) time bound in practice, and it also provided insight into the causes of unreliability in networks. Thesis Supervisor: David R. Karger Title: Assistant Professor |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://dspace.mit.edu/bitstream/handle/1721.1/38183/37145395-MIT.pdf;jsessionid=2A9848AACE6C5CA493BFD9C3A1A13568?sequence=2 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |