Renewal networks: Connectivity and reachability on a time interval

Charles J. Colbourn, Michael V. Lomonosov

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish
Pages (from-to)361-368
Number of pages8
JournalProbability in the Engineering and Informational Sciences
Issue number3
StatePublished - 1 Jan 1991

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Renewal networks: Connectivity and reachability on a time interval'. Together they form a unique fingerprint.

Cite this