Buy-at-Bulk Network Design with Protection

We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against a single edge or node failure in the network. In practice, the most popular model used in high-speed telecommunication networks for protection against failures is the so-called 1 + 1 model. In this model, two-edge or node-disjoint paths are provisioned for each demand pair. We obtain the first nontrivial approximation algorithms for buy-at-bulk network design in the 1 + 1 model for both edge and node-disjoint protection requirements. Our results are for the single-cable cost model, which is prevalent in optical networks. More specifically, we present a constant-factor approximation for the single-sink case and a polylogarithmic factor approximation for the multicommodity case. These results are of interest for practical applications and also suggest several new challenging theoretical problems.

[1]  R. Ravi,et al.  Online and stochastic survivable network design , 2009, STOC '09.

[2]  Arun K. Somani.  Survivability and Traffic Grooming in WDM Optical Networks , 2006 .

[3]  Kunal Talwar,et al.  The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.

[4]  Matthew Andrews,et al.  Hardness of buy-at-bulk network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Moses Charikar,et al.  On non-uniform multicommodity buy-at-bulk network design , 2005, STOC '05.

[6]  Thomas E. Stern,et al.  Multiwavelength Optical Networks: A Layered Approach , 1999 .

[7]  R. Ravi,et al.  Approximation Algorithms for a Capacitated Network Design Problem , 2003, Algorithmica.

[8]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[9]  Chandra Chekuri,et al.  Single-Sink Network Design with Vertex Connectivity Requirements , 2008, FSTTCS.

[10]  Balaji Raghavachari,et al.  Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems , 2004, SWAT.

[11]  David P. Williamson,et al.  A primal-dual approximation algorithm for generalized steiner network problems , 1995, Comb..

[12]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design , 2010, SIAM J. Comput..

[13]  Kamal Jain.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[14]  Guy Kortsarz,et al.  Approximating some network design problems with node costs , 2011, Theor. Comput. Sci..

[15]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[16]  Joseph Naor,et al.  On the approximability of some network design problems , 2005, SODA '05.

[17]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[18]  Sanjeev Khanna,et al.  The all-or-nothing multicommodity flow problem , 2004, STOC '04.

[19]  Tim Roughgarden,et al.  Approximation via cost sharing , 2007, J. ACM.

[20]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[21]  Kamesh Munagala,et al.  Cost-Distance: Two Metric Network Design , 2008, SIAM J. Comput..

[22]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[23]  Sudipto Guha,et al.  A Constant Factor Approximation for the Single Sink Edge Installation Problem , 2009, SIAM J. Comput..

[24]  Sanjeev Khanna,et al.  An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design , 2012, Theory Comput..

[25]  David P. Williamson,et al.  Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..

[26]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[27]  R. Ravi,et al.  Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..

[28]  Daniel C. Kilper,et al.  Design tools for transparent optical networks , 2006, Bell Labs Technical Journal.

[29]  Lisa Zhang,et al.  Approximation Algorithms for Access Network Design , 2002, Algorithmica.

[30]  Fabrizio Grandoni,et al.  Improved Approximation for Single-Sink Buy-at-Bulk , 2006, ISAAC.

[31]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[32]  Andrew McGregor,et al.  Island hopping and path colouring with applications to WDM network design , 2007, SODA '07.