Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing

We consider circuit routing with an objective of minimizing energy, in a network of routers that are speed scalable and that may be shutdown when idle. It is known that this energy minimization problem can be reduced to a capacitated flow network design problem, where vertices have a common capacity but arbitrary costs, and the goal is to choose a minimum cost collection of vertices whose induced subgraph will support the specified flow requirements. For the multicast (single-sink) capacitated design problem we give a polynomial-time algorithm that is O(log3 n)- approximate with O(log4 n) congestion. This translates back to a O(log4α+3 n)-approximation for the multicast energy-minimization routing problem, where α is the polynomial exponent in the dynamic power used by a router. For the unicast (multicommodity) capacitated design problem we give a polynomial-time algorithm that is O(log5 n)-approximate with O(log12 n) congestion, which translates back to a O(log12α+5 n)-approximation for the unicast energy-minimization routing problem.

[1]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[2]  Yuval Rabani,et al.  Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems , 2007, SIAM J. Comput..

[3]  Sanjeev Khanna,et al.  Network design for vertex connectivity , 2008, STOC.

[4]  David R. Karger,et al.  Random sampling in cut, flow, and network design problems , 1994, STOC '94.

[5]  Spyridon Antonakopoulos,et al.  Buy-at-Bulk Network Design with Protection , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[6]  Lisa Zhang,et al.  Routing for Energy Minimization in the Speed Scaling Model , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Kirk Pruhs,et al.  Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling , 2011, WAOA.

[8]  Andrew V. Goldberg,et al.  Algorithms for Hub Label Optimization , 2013, ICALP.

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

[10]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[11]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[12]  Manish Gupta,et al.  Power-Aware Microarchitecture: Design and Modeling Challenges for Next-Generation Microprocessors , 2000, IEEE Micro.

[13]  Lachlan L. H. Andrew,et al.  Power-Aware Speed Scaling in Processor Sharing Systems , 2009, IEEE INFOCOM 2009.

[14]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[15]  Shi Li,et al.  Capacitated Network Design on Undirected Graphs , 2013, APPROX-RANDOM.

[16]  Shang-Hua Teng,et al.  Spectral Sparsification of Graphs , 2008, SIAM J. Comput..

[17]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[18]  David R. Karger,et al.  Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..

[19]  Mohammad Taghi Hajiaghayi,et al.  Approximation algorithms for node-weighted buy-at-bulk network design , 2007, SODA '07.

[20]  Jim Kurose,et al.  Computer Networking: A Top-Down Approach , 1999 .

[21]  Jochen Könemann,et al.  An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

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

[23]  Kirk Pruhs,et al.  Multicast Routing for Energy Minimization Using Speed Scaling , 2012, MedAlg.

[24]  Sudipto Guha,et al.  A constant factor approximation for the single sink edge installation problems , 2001, STOC '01.

[25]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[26]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[27]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

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

[29]  Debmalya Panigrahi,et al.  A general framework for graph sparsification , 2010, STOC '11.

[30]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[31]  Spyridon Antonakopoulos,et al.  Minimum-Cost Network Design with (Dis)economies of Scale , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[32]  Sanjeev Khanna,et al.  Approximability of Capacitated Network Design , 2010, Algorithmica.

[33]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1999, Comb..

[34]  R. Khandekar,et al.  Capacitated Network Design Problems : Hardness , Approximation Algorithms , and Connections to Group Steiner Tree ∗ , 2012 .

[35]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[36]  Kirk Pruhs,et al.  Hallucination Helps: Energy Efficient Virtual Circuit Routing , 2014, SODA.