Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-24T01:15:39.980Z Has data issue: false hasContentIssue false
  • English
  • Français

Renewal Networks: Connectivity and Reachability on a Time Interval

Published online by Cambridge University Press:  27 July 2009

Charles J. Colbourn  and
Michael V. Lomonosov
Charles J. Colbourn
Affiliation:
Department of Combinatorics and Optimization University of Waterloo, Waterloo, Ontario, CanadaN2L 3G 1
Michael V. Lomonosov
Affiliation:
Department of Mathematics and Computer Science Ben Gurion University of the Negev Beer, Sheva 84 120, Israel
Get access Rights & Permissions [Opens in a new window]

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Colbourn, C.J. (1987). The combinatorics of network reliability. New York: Oxford University Press.Google Scholar
Colbourn, C.J. (1991). A note on bounding k-terminal reliability. Algorithmica (to appear).Google Scholar
Edmonds, J. (1972). Edge-disjoint branchings. In Rustin, R. (ed.), Combinatorial algorithms. New York: Algorithmics Press, pp. 91–96.Google Scholar
Feller, W. (1966). An introduction to probability theory and its applications. New York: Wiley.Google Scholar
Lomonosov, M.V. (1974). Bernoulli scheme with closure. Problems of Information Transmission 10: 73–81.Google Scholar
Nakazawa, H. (1979). Equivalence of a nonoriented line and a pair of oriented lines in a network. IEEE Transactions on Reliability R28: 364–367.CrossRefGoogle Scholar
Provan, J.S. (1986). The complexity of reliability computations on planar and acyclic graphs. SIAM Journal of Computing 15: 694–702.CrossRefGoogle Scholar
Vertigan, D. (1991). The computational complexity of Tutte invariants for planar graphs (preprint).Google Scholar