Design and Analysis of Algorithms pp 37-51
Multicast Routing for Energy Minimization Using Speed Scaling
- Cite this paper as:
- Bansal N., Gupta A., Krishnaswamy R., Nagarajan V., Pruhs K., Stein C. (2012) Multicast Routing for Energy Minimization Using Speed Scaling. In: Even G., Rawitz D. (eds) Design and Analysis of Algorithms. Lecture Notes in Computer Science, vol 7659. Springer, Berlin, Heidelberg
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 ti a routing path (the virtual circuit) Pi connecting a fixed source s to sink ti 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.
Unable to display preview. Download preview PDF.