Multicast Routing for Energy Minimization Using Speed Scaling
Cached
| Citations: | 3 - 2 self |
BibTeX
@MISC{Bansal_multicastrouting,
author = {Nikhil Bansal and Anupam Gupta and Ravishankar Krishnaswamy and Viswanath Nagarajan and Kirk Pruhs and Cliff Stein},
title = {Multicast Routing for Energy Minimization Using Speed Scaling},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. 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 polynomialtime 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. 1
Keyphrases
multicast routing energy minimization using speed scaling polylog-competitive online algorithm different power function speed scalable network virtual circuit approximation offline algorithm vertex ti static power polynomial time virtual circuit multicast routing aggregate power algorithmic literature standard complexity assumption power function poly-log approximation first result
