The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an O(n\*) time algorithm to compute the resilience of n-node k-tree networks with fai
โฆ LIBER โฆ
Building Edge-Failure Resilient Networks
โ Scribed by Chandra Chekuri; A. Gupta; Amit Kumar; J. Naor; Danny Raz
- Book ID
- 106148606
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 278 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Resilience of partial k-tree networks wi
โ
Erick Mata-Montero
๐
Article
๐
1991
๐
John Wiley and Sons
๐
English
โ 965 KB
Optimizing complex networks for resilien
โ
J. Ash; D. Newth
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 667 KB
Our modern society has come to depend on large-scale infrastructure networks to deliver resources to our homes and businesses in an efficient manner. Over the past 10 years there have been numerous examples where a local disturbance has lead to the global failure of systems. In this paper, we use an
Network Resilience
โ
Colbourn, Charles J.
๐
Article
๐
1987
๐
Society for Industrial and Applied Mathematics
โ 856 KB
Academic Care: Building Resilience, Buil
โ
Ann J. Nadge
๐
Article
๐
2005
๐
John Wiley and Sons
๐
English
โ 71 KB
Resilient objects in broadband networks
โ
Jalote, P.
๐
Article
๐
1989
๐
IEEE
๐
English
โ 578 KB
Resilient mounting systems in buildings
โ
R. Breeuwer; J.C. Tukker
๐
Article
๐
1976
๐
Elsevier Science
๐
English
โ 965 KB