A Heuristic with Bounded Guarantee to Compute Diverse Paths under Shared Protection in WDM Mesh Networks

Establishing a fault-tolerant connection in a network involves computation of diverse working and protection paths. The Shared Risk Link Group (SRLG) [1] concept is used to model several types of failure conditions such as link, node, fiber conduit, etc. In this work we focus on the problem of computing optimal SRLG/link diverse paths under shared protection. Shared protection technique improves network resource utilization by allowing protection paths of multiple connections to share resources. In this work we propose an iterative heuristic for computing SRLG/link diverse paths. We present a method to calculate a quantitative measure that provides a bounded guarantee on the optimality of the diverse paths computed by the heuristic. The experimental results on computing link diverse paths show that our proposed heuristic is efficient in terms of number of iterations required (time taken) to compute diverse paths when compared to other previously proposed heuristics.

Comparison of Two Roadside Survey Procedures for Dwarf Mistletoes on the Sawtooth National Forest, Idaho

Two roadside surveys were conducted for dwarf mistletoes parasitizing lodgepole pine and Douglas-fir on the Sawtooth National Forest, Idaho. One survey used variable-radius plots located less than 150 m from roads. The 2nd survey used variable-radius plots established at 200-m intervals along 1600-m transects run perpendicular to the same roads. Estimates of the incidence (percentage of trees infected and percentage of plots infested) and severity (average dwarf mistletoe rating) for both lodgepole pine and Douglas-fir dwarf mistletoes were not significantly different for the 2 survey methods. These findings are further evidence that roadside-plot surveys and transect-plot surveys conducted away from roads provide similar estimates of the incidence of dwarf mistletoes for large forested areas.