Article contents
Renewal Networks: Connectivity and Reachability on a Time Interval
Published online by Cambridge University Press: 27 July 2009
Abstract
Efficiently computable bounds are developed for the time to first failure in a communications network with renewable links. The bounds approximate a network with bidirectional or unidirectional links by acyclic networks with unidirectional links.
- Type
- Articles
- Information
- Probability in the Engineering and Informational Sciences , Volume 5 , Issue 3 , July 1991 , pp. 361 - 368
- Copyright
- Copyright © Cambridge University Press 1991
References
REFERENCES
- 1
- Cited by