Renewal Networks: Connectivity and Reachability on a Time Interval

DOI10.1017/S0269964800002151MaRDI QIDQ3416020zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Michael V. Lomonosov

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800002151

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Calculating bounds on reachability and connectedness in stochastic networks
• Improving reliability bounds in computer networks
• Bounding the Reliability of Networks
• First-and second-order bounds on terminal reliability
• Bounds on expected performance of networks with links subject to failure

Cites work

• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• Invariant subspaces for the family of operators which commute with a completely continuous operator
• The Complexity of Reliability Computations in Planar and Acyclic Graphs

This page was built for publication: Renewal Networks: Connectivity and Reachability on a Time Interval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416020)