A memory efficient algorithm for network reliability

@article{Herrmann2009AME,
  title={A memory efficient algorithm for network reliability},
  author={Johannes Ulrich Herrmann and Sieteng Soh},
  journal={2009 15th Asia-Pacific Conference on Communications},
  year={2009},
  pages={703-707}
}
We combine the Augmented Ordered Binary Decision Diagram (OBDD-A) with the use of boundary sets to create a method for computing the exact K-terminal or all-terminal reliability of an undirected network with failed edges and perfect vertices. We present the results of implementing this algorithm and show that the execution time is comparable with the state of the art and the space requirement is greatly reduced. Indeed the space remains constant when networks increase in size but maintain their… CONTINUE READING
5 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

" KTerminal Network Reliability Measures With Binary Decision Diagrams

  • C. Lucet G. Hardy, N. Limnios
  • 2007

Computer Aided Reliability Evaluation for Distributed Computing Networks

  • S. Rai
  • 1991

Similar Papers

Loading similar papers…