Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with Shared Risk Link Groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in [1]. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to [1]) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we computed the survivable virtual topology routing against link and SRLG failures for small and medium sized networks efficiently. As even our improved ILP formulation becomes intractable for large networks, we present a congestion-based heuristic and a tabu search heuristic (which uses the congestion-based heuristic solution as the initial solution) for computing survivable routing of a virtual topology. Our experimental results show that tabu search heuristic coupled with the congestion based heuristic (used as initial solution) provides fast and near-optimal solutions.

Survivable Waveband Switching in WDM Mesh Networks under Dedicated Path-Protection

This paper considers the problem of dedicated path-protection in wavelength-division multiplexed (WDM) mesh networks with waveband switching functionality under shared risk link group (SRLG) constraints. Two dedicated path protection schemes are proposed, namely the PBABL scheme and the MPABWL scheme. The PBABL scheme protects each working waveband-path through a backup waveband-path. The MPABWL scheme protects each working waveband-path by either a backup waveband-path or multiple backup lightpaths. Heuristic algorithms adopting random optimization technique are proposed for both the schemes. The performance of the two protection schemes is studied and compared. Simulation results show that both the heuristics can obtain optimum solutions and the MPABWL scheme leads to less switching and transmission costs than the PBABL scheme.

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.

CC96-396 Productcion Flexibility Contracts: Provisions, Implications and the Participation Decision

The Federal Agriculture Improvement and Reform (FAIR) Act of 1996 (P.L. 104-127) was signed into law by President Clinton on April 4, 1996. Most provisions of the new law, including the commodity provisions, will be effective for seven years, 1996-2002. Unlike previous farm bills, provisions relating to commodity supports are grouped together under what is known as the Agricultural Market Transition Act (AMTA) program. Producers of seven commodities: corn, sorghum, barley, oats, wheat, rice and cotton must sign Productive Flexibility Contracts (PFCs) to participate in the AMTA. These seven commodities are referred to as "contract commodities." This publication focuses on the PFCs, beginning with an overview of contract provisions. Potential short- and long-run implications of PFCs are then discussed.

Making an ACRE Decision for 2009

The initial sign-up period for 2009 farm commodity programs and the choice between the new ACRE (Average Crop Revenue Election) program and the existing DCP (Direct and Counter-Cyclical Payment) program is quickly winding down. But as the current August 14 deadline approaches, producers know more and more about the potential safety net provided under the ACRE program, and have a better opportunity to analyze the economics of choosing ACRE versus the DCP program before visiting their USDA Farm Service Agency (FSA) office.