The complexity of the K-reliability in networks constrained to diameter two

Consider a communication network with a set of sites and a set of links between them. Suppose that the sites are perfect but the links can fail independently from one another. Suppose also that at any given instant t, every link xy is operational or failed with probabilities denoted by p(xy) and 1 -...

Full description

Bibliographic Details

Main Author:	Canale, Eduardo (author)
Other Authors:	Cancela, Héctor (author), Robledo, Franco (author), Sartor, Pablo (author)
Format:	report
Published:	2012
Subjects:	Network reliability Survivability Diameter constraints Combinatorial problems Computational complexity Formal verification
Online Access:	http://hdl.handle.net/20.500.12008/3465
Tags:	Add Tag No Tags, Be the first to tag this record!