A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
An effective algorithm for computing all-terminal reliability bounds

2015
*
Networks
*

., and Kounev, V. (2015),

doi:10.1002/net.21634
fatcat:5z7e5myr5remjh3iof6fn3geie
*An*effective*algorithm**for*computing all-terminal*reliability**bounds*. ... The exact calculation of all-terminal*reliability*is not feasible in large*networks*. Hence estimation techniques and lower and upper*bounds**for*all-terminal*reliability*have been utilized. ... Furthermore, there is the well-known factoring theorem that leads to*an**algorithm**for*the calculation of the*network**reliability*proposed by Moskowitz [11, 29] . ...##
###
An algorithm for computing all-terminal reliability bounds

2014
*
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)
*

The performance of the

doi:10.1109/rndm.2014.7014934
fatcat:cwdynrcx2zg6voxk5gfegp3vxm
*algorithm*is compared with the first two Bonferroni*bounds*,*for**networks*where all mincuts could be calculated. ... The exact calculation of all-terminal*reliability*is not feasible in large*networks*. Hence estimation techniques and lower and upper*bounds**for*all-terminal*reliability*have been utilized. ... The work of Teresa Gomes and Lúcia Martins has been partially supported by the Portuguese Foundation*for*Science and Technology under project grant PEst-OE/ EEI/UI308/2014 and ICIS Project CENTRO-07-0224 ...##
###
A Comparison between Two All-Terminal Reliability Algorithms

2015
*
Journal of Advances in Computer Networks
*

However,

doi:10.18178/jacn.2015.3.4.183
fatcat:or4hqpkssjd5pmgm3sgwi4g4dq
*for*some large*networks*the decomposition*algorithm*does not give results while the path-and cutset*algorithm*still returns*bounds*. ... Two*algorithms*computing the all-terminal*reliability*are compared. The first*algorithm*uses the pathsets and cutsets of the*network*to find lower and upper*bounds*respectively. ... In [11] and [12]*an**algorithm*is proposed*for*calculating lower and upper*bounds**for*the all terminal*reliability*1 . ...##
###
Reliability Optimization of Distributed Access Networks With Constrained Total Cost

2005
*
IEEE Transactions on Reliability
*

Index Terms-Branch and

doi:10.1109/tr.2005.853440
fatcat:vvxpp7l56rhmfavctg2acdahqa
*bound*, distributed access*networks*, optimization, system*reliability*. ... Because the calculation of each possible solution*for*the*reliability*problem is extremely time-consuming, a novel*algorithm*, the Shrinking & Searching*Algorithm*(SSA), is proposed to speed up the searching ... ACKNOWLEDGMENT The authors wish to thank the anonymous reviewers*for*their helpful comments & suggestions. ...##
###
Computing and maximizing the exact reliability of wireless backhaul networks

2018
*
Electronic Notes in Discrete Mathematics
*

Any such tree provides

doi:10.1016/j.endm.2018.01.010
fatcat:nhxqagzyjfe2llxgb7rrmiuvme
*an*upper and lower*bound*on the*reliability*, and the*algorithm*improves these*bounds*by branching in the tree. ... We provide*an**algorithm*that exploits properties of the conditional probability tree used to calculate*reliability*of a given*network*design. ... We provide*an**algorithm*to compute the exact*reliability*of a backhaul*network*in this setting. ...##
###
Topological optimization with a network reliability constraint

2001
*
Discrete Applied Mathematics
*

Jan et al. have proposed

doi:10.1016/s0166-218x(01)00221-9
fatcat:dacd4cyjqvdyfm36neotwmbp4a
*an**algorithm*to ÿnd the optimal selection of edges in*networks*, with minimum cost, under all-terminal*reliability*is not less than a given level. ... This paper considers a*network*topological optimization problem with a*reliability*constraint. ... Acknowledgements We are grateful to the referees*for*their kind and valuable comments on this manuscript. ...##
###
Bounding the Reliability of Networks

1992
*
Journal of the Operational Research Society
*

Liu—

doi:10.1057/jors.1992.79
fatcat:xtd4tokiynevjif2hnig3zkrii
*Bounding*the*Reliability*of*Networks*TABLE 3.*Bounds*and exact*reliability*values*for*the*network*of Locks? ... A variety of*algorithms*have been proposed*for*calculating such measures of*network**reliability*. ...##
###
A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

2011
*
Computers and Mathematics with Applications
*

This paper considers a

doi:10.1016/j.camwa.2010.09.033
fatcat:i3tlqpk7l5hudpjc5thgc3ntom
*bounding**algorithm**for*computing twoterminal*reliability*based on decomposition technique originally used in computing multistate*reliability*. ... Two-terminal*reliability*, which is defined as the probability that there exists at least one path from source node to sink node, is*an*important performance measure in*network*system. ... Hence, the lower and upper*bounds*on coefficients provide the lower and upper*bounds*on*reliability*[9] [10] [11] . This paper considers a*bounding**algorithm**for*two-terminal*reliability*. ...##
###
Bounding the Reliability of Networks

1992
*
Journal of the Operational Research Society
*

A variety of

doi:10.2307/2583572
fatcat:wa4puiefuvaajfxrwzgbyaxesy
*algorithms*have been proposed*for*calculating such measures of*network**reliability*. ...*For*example, a number of upper*bounds*'*"* and lower bounds’™'':'° on*network**reliability*have been developed and have produced encouraging insights. ...##
###
Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

2019
*
Mathematical Problems in Engineering
*

*An*efficient

*algorithm*based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem.

*An*extension problem that considers multiple constraints is discussed. ... The study focuses on a multiple constrained

*reliable*path problem in which travel time

*reliability*and resource constraints are collectively considered. ... Dijkstra's

*algorithm*(or Dijkstra's Shortest Path First

*algorithm*, SPF

*algorithm*) is

*an*

*algorithm*

*for*finding the classical shortest paths between nodes in a graph [28] . ...

##
###
Estimation of Small s-t Reliabilities in Acyclic Networks
[article]

2007
*
arXiv
*
pre-print

*For*the case of uniform edge failure probabilities, we give a worst-case

*bound*on the number of samples that have to be drawn to obtain

*an*epsilon-delta approximation, being sharper than the original upper ... In the classical s-t

*network*

*reliability*problem a fixed

*network*G is given including two designated vertices s and t (called terminals). ... When combining the above theorem with Theorem 3 we obtain that

*Algorithm*1 is

*an*FPRAS if e∈E (1 + q(e)) is

*bounded*by a polynomial in the input size of the

*reliability*

*network*G. ...

##
###
Reliability in Layered Networks With Random Link Failures

2011
*
IEEE/ACM Transactions on Networking
*

Based on this observation, we develop

doi:10.1109/tnet.2011.2143425
fatcat:t7atomfzrrdo5lf7mwcto4vfse
*algorithms**for*routing the logical topology to maximize*reliability*. ... Our approach gives*an*approximate expression*for**reliability*as a function of the link failure probability, eliminating the need to resample*for*different values of the failure probability. ... LIGHTPATH ROUTING*ALGORITHMS**FOR**RELIABILITY*MAXIMIZATION As illustrated in Section III-A, lightpath routing in a layered*network*plays*an*important role in the*reliability*. ...##
###
Page 6369 of Mathematical Reviews Vol. , Issue 96j
[page]

1996
*
Mathematical Reviews
*

Summary: “In the paper we present

*an**algorithm**for*computing*reliability*of complex systems which is a junction of the top-down, bottom-up and Poincaré*algorithms*. ... (I-BOLO-EE; Bologna)*An*exact*algorithm**for*the capacitated shortest spanning arborescence. ...##
###
Page 539 of The Journal of the Operational Research Society Vol. 43, Issue 5
[page]

1992
*
The Journal of the Operational Research Society
*

A variety of

*algorithms*have been proposed*for*calculating such measures of*network**reliability*. ...*For*example, a number of upper*bounds*'*"* and lower bounds’™'':'° on*network**reliability*have been developed and have produced encouraging insights. ...##
###
Reliability in Layered Networks with Random Link Failures

2010
*
2010 Proceedings IEEE INFOCOM
*

Based on this observation, we develop

doi:10.1109/infcom.2010.5461985
dblp:conf/infocom/LeeLM10
fatcat:3zcvkagek5ckdiltyeqmxp5jmi
*algorithms**for*routing the logical topology to maximize*reliability*. ... Our approach gives*an*approximate expression*for**reliability*as a function of the link failure probability, eliminating the need to resample*for*different values of the failure probability. ... LIGHTPATH ROUTING*ALGORITHMS**FOR**RELIABILITY*MAXIMIZATION As illustrated in Section III-A, lightpath routing in a layered*network*plays*an*important role in the*reliability*. ...
« Previous

*Showing results 1 — 15 out of 254,754 results*