Renewal networks: Connectivity and reachability on a time interval

Charles J. Colbourn; Michael V. Lomonosov

doi:10.1017/S0269964800002151

Renewal networks: Connectivity and reachability on a time interval

Charles J. Colbourn, Michael V. Lomonosov

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English (US)
Pages (from-to)	361-368
Number of pages	8
Journal	Probability in the Engineering and Informational Sciences
Volume	5
Issue number	3
DOIs	https://doi.org/10.1017/S0269964800002151
State	Published - 1991
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1017/S0269964800002151

Cite this

@article{c40c9d2db422404ab595ad8f0d010285,

title = "Renewal networks: Connectivity and reachability on a time interval",

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.",

author = "Colbourn, {Charles J.} and Lomonosov, {Michael V.}",

note = "Funding Information: Research of the first author is supported by NSERC Canada under grant number A0579. {\textcopyright} 1991 Cambridge University Press 0269-9648/91 $5.00 + .00",

year = "1991",

doi = "10.1017/S0269964800002151",

language = "English (US)",

volume = "5",

pages = "361--368",

journal = "Probability in the Engineering and Informational Sciences",

issn = "0269-9648",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - Renewal networks

T2 - Connectivity and reachability on a time interval

AU - Colbourn, Charles J.

AU - Lomonosov, Michael V.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84974410153&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84974410153&partnerID=8YFLogxK

U2 - 10.1017/S0269964800002151

DO - 10.1017/S0269964800002151

M3 - Article

AN - SCOPUS:84974410153

SN - 0269-9648

VL - 5

SP - 361

EP - 368

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

IS - 3

ER -

Renewal networks: Connectivity and reachability on a time interval

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this