Sciweavers

SIGMETRICS
2006
ACM

Robust network connectivity: when it's the big picture that matters

14 years 5 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition that guarantees good connectivity between regions of such a network. Good connectivity means that the regions are connected by nearly as many disjoint, fault-free paths as there are when the entire network is fault-free. The topological condition is satisfied in many cases of practical interest, even when two regions are at a distance much larger than the expected ”distance between faults”, 1/p. We extend this result to networks with failures on nodes, as well as geometric radio networks with random distribution of nodes in a deployment area of a given topography. A rigorous formalization of the intuitive notion of “hole” in a (not necessarily planar) graph is at the heart of our result and our proof. Holes, in the presence of faults, degrade connectivity in the region “around” them to a distance t...
Enoch Peserico, Larry Rudolph
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SIGMETRICS
Authors Enoch Peserico, Larry Rudolph
Comments (0)