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 -...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Eará dahkkit: | , , |
| Materiálatiipa: | report |
| Almmustuhtton: |
2012
|
| Fáttát: | |
| Liŋkkat: | http://hdl.handle.net/20.500.12008/3465 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Geahča maid: The complexity of the K-reliability in networks constrained to diameter two
- Network reliability analysis and intractability of counting diameter crystal graphs
- Bounded Monte Carlo estimation of diameter-constrained network reliability
- Diameter constrained network reliability :exact evaluation by factorization and bounds
- Polynomial-time topological reductions that preserve the diameter constrained reliability of a communication network :un ambiente para el desarrollo de experimentos científicos
- Diameter-constrained reliability : theory and applications
- Domination Invariant of a Diameter Constrained Network Reliability Model