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

Täydet tiedot

Bibliografiset tiedot

Päätekijä:	Canale, Eduardo (author)
Muut tekijät:	Cancela, Héctor (author), Robledo, Franco (author), Sartor, Pablo (author)
Aineistotyyppi:	report
Julkaistu:	2012
Aiheet:	Network reliability Survivability Diameter constraints Combinatorial problems Computational complexity Formal verification
Linkit:	http://hdl.handle.net/20.500.12008/3465
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!