Multicast Routing for Energy Minimization Using Speed Scaling

  • Nikhil Bansal
  • Anupam Gupta
  • Ravishankar Krishnaswamy
  • Viswanath Nagarajan
  • Kirk Pruhs
  • Cliff Stein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7659)


We consider virtual circuit multicast routing in a network of links that are speed scalable. We assume that a link with load f uses power σ + f α , where σ is the static power, and α > 1 is some constant. We assume that a link may be shutdown if not in use. In response to the arrival of client i at vertex t i a routing path (the virtual circuit) P i connecting a fixed source s to sink t i must be established. The objective is to minimize the aggregate power used by all links.

We give a polylog-competitive online algorithm, and a polynomial-time O(α)-approximation offline algorithm if the power functions of all links are the same. If each link can have a different power function, we show that the problem is APX-hard. If additionally, the edges may be directed, then we show that no poly-log approximation is possible in polynomial time under standard complexity assumptions. These are the first results on multicast routing in speed scalable networks in the algorithmic literature.


Power Function Steiner Tree Online Algorithm Vertex Cover Satisfying Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Proceedings of the vision and roadmap workshop on routing telecom and data centers toward efficient energy use (October 2008)Google Scholar
  2. 2.
    Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (dis)economies of scale. In: FOCS, pp. 585–592 (2010)Google Scholar
  3. 3.
    Andrews, M., Fernández, A., Zhang, L., Zhao, W.: Routing for energy minimization in the speed scaling model. In: INFOCOM, pp. 2435–2443 (2010)Google Scholar
  4. 4.
    Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486–504 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Benoit, A., Melhem, R., Renaud-Goud, P., Robert, Y.: Power-aware manhattan routing on chip multiprocessors. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS) (May 2012)Google Scholar
  6. 6.
    Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of Capacitated Network Design. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 78–91. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Gafni, E.M., Bertsekas, D.P.: Path assignment for virtual circuit routing. In: Proceedings of the Symposium on Communications Architectures & Protocols, SIGCOMM 1983, pp. 21–25. ACM, New York (1983)CrossRefGoogle Scholar
  8. 8.
    Gupta, A., Krishnaswamy, R., Pruhs, K.: Online primal-dual for non-linear optimization with applications to speed scaling. CoRR, abs/1109.5931 (2011)Google Scholar
  9. 9.
    Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math. 4(3), 369–384 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Johnson, W.B., Schechtman, G., Zinn, J.: Best constants in moment inequalities for linear combinations of independent and exchangeable random variables. Ann. Probab. (1), 234–253 (1985)Google Scholar
  11. 11.
    Kim, J., Horowitz, M.A.: Adaptive supply serial links with sub-1-v operation and per-pin clock recovery. IEEE Journal of Solid-State Circuits 37(11), 1403–1413 (2002)CrossRefGoogle Scholar
  12. 12.
    Raz, R.: A parallel repetition theorem. SIAM J. Comput. 27(3), 763–803 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Rosenthal, H.P.: On the subspaces of L p (p > 2) spanned by sequences of independent random variables. Israel J. Math. 8, 273–303 (1970)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: ACM Symposium on Theory of Computing, pp. 453–461 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Nikhil Bansal
    • 1
  • Anupam Gupta
    • 2
  • Ravishankar Krishnaswamy
    • 3
  • Viswanath Nagarajan
    • 4
  • Kirk Pruhs
    • 5
  • Cliff Stein
    • 6
  1. 1.Mathematics and Computer ScienceEindhoven University of TechnologyThe Netherlands
  2. 2.Computer ScienceCarnegie Mellon UniversityUnited States
  3. 3.Computer SciencePrinceton UniversityUnited States
  4. 4.IBM T.J. Watson Research CenterUnited States
  5. 5.Computer ScienceUniversity of PittsburghUnited States
  6. 6.Industrial Engineering and Operations ResearchColumbia UniversityUnited States

Personalised recommendations