Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.

Least-cost Disjoint Paths with Dependent Cost Structure in Wavelength Continuous Optical WDM Networks

One of the important issues in establishing a fault tolerant connection in a wavelength division multiplexing optical network is computing a pair of disjoint working and protection paths and a free wavelength along the paths. While most of the earlier research focused only on computing disjoint paths, in this work we consider computing both disjoint paths and a free wavelength along the paths. The concept of dependent cost structure (DCS) of protection paths to enhance their resource sharing ability was proposed in our earlier work. In this work we extend the concept of DCS of protection paths to wavelength continuous networks. We formalize the problem of computing disjoint paths with DCS in wavelength continuous networks and prove that it is NP-complete. We present an iterative heuristic that uses a layered graph model to compute disjoint paths with DCS and identify a free wavelength.

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.

Vanishing of Ext and Tor over complete intersections

Let (R,m) be a local complete intersection, that is, a local ring whose m-adic completion is the quotient of a complete regular local ring by a regular sequence. Let M and N be finitely generated R-modules. This dissertation concerns the vanishing of Tor(M, N) and Ext(M, N). In this context, M satisfies Serre's condition (S_{n}) if and only if M is an nth syzygy. The complexity of M is the least nonnegative integer r such that the nth Betti number of M is bounded by a polynomial of degree r-1 for all sufficiently large n. We use this notion of Serre's condition and complexity to study the vanishing of Tor_{i}(M, N). In particular, building on results of C. Huneke, D. Jorgensen and R. Wiegand [32], and H. Dao [21], we obtain new results showing that good depth properties on the R-modules M, N and MtensorN force the vanishing of Tor_{i}(M, N) for all i>0. We give examples showing that our results are sharp. We also show that if R is a one-dimensional domain and M and MtensorHom(M,R) are torsion-free, then M is free if and only if M has complexity at most one. If R is a hypersurface and Ext^{i}(M, N) has finite length for all i>>0, then the Herbrand difference [18] is defined as length(Ext^{2n}(M, N))-(Ext^{2n-1}(M, N)) for some (equivalently, every) sufficiently large integer n. In joint work with Hailong Dao, we generalize and study the Herbrand difference. Using the Grothendieck group of finitely generated R-modules, we also examined the number of consecutive vanishing of Ext^{i}(M, N) needed to ensure that Ext^{i}(M, N) = 0 for all i>>0. Our results recover and improve on most of the known bounds in the literature, especially when R has dimension two.

COMPLETE CONTROL OF NUISANCE BIRDS IN AIRPORT HANGARS

Fogging of ReJeX-iT7 TP-40 offers a very efficient method for the control and dispersal of nuisance birds from many diverse areas. The amount of the repellent is greatly reduced over any other control method. The method is direct and is independent of the activity of the birds. The applications with any fogger, thermal or mechanical, that can deliver droplets of less than 20 microns, can be manually or fully automated and pose only minimal risks to operators or animals. All birds that became a nuisance and safety problem in the hangars of TWA and AA at LaGuardia, and TWA warehouse at Newark Airport were successfully driven out by fogging ReJeX-iT7 TP-40 with a Curtis Dyna-Fog AGolden Eagle@ thermal fogger.