This report covers the work done in support of the DARPA Information Technology Office program in computer networking. Contributors to this effort include Prof. David L. Mills, graduate student Harish Nair and undergraduate research student John Conner. MS student Tamal Basu has graduated and taken a position at Acorn Networks. Phd student Qiong Li has graduated and taken a position with Philli...

We address the problem of designing two-level networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals must be assigned to hubs and connected to them through access networks, being the objective to minimize the total cost. We consider two survivable structures, two-edge connected...

We consider survivable network design problems under a two-stage stochastic model with recourse and finitely many scenarios (SSNDP). We propose two new cut-based formulations for SSNDP based on orientation properties and show that they are stronger than the undirected cut-based model. We use a two-stage branch&cut algorithm for solving the decomposed model to provable optimality. In order to ac...

Millimeter-wave mesh networks have the potential to provide cost-effective highbandwidth solutions to many current bandwidth-constrained networks including cellular backhaul. However, the availability of such networks is severely limited due to their susceptibility to weather, such as precipitation and humidity. In this paper, we present a rigorous approach to survivable millimeter-wave mesh ne...

We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for this problem, by extending a linear programming based technique of iterative rounding. Previously, a (4, 4)-approximation algorithm for this problem was known. The running time of this previous algorithm is not strong...

We present a genetic algorithm for the design of survivable networks with minimum capital expenditure. The survivability against any single link failure is ensured by path dedicated protection. An integer linear programming model to evaluate the quality of the genetic algorithm solutions is also presented. Using the integer linear programming model and the genetic algorithm near-optimal topolog...