Published May 2012
| public
Book Section - Chapter
Algorithms for dynamic capacity provisioning
Abstract
Data centre power consumption can be reduced by switching off servers during low load. However, excess switching is wasteful. This paper reviews online algorithms for optimizing this tradeoff, including the benefits of shifting load between geographically distant data centres. These algorithms can also adjust a link's number of parallel lightpaths.
Additional Information
© 2012 IEICE. This work was supported by NSF grants CCF 0830511, CNS 0911041, and CNS 0846025, MURI grant W911NF-08-1-0233, Microsoft Research, the Lee Center for Advanced Networking, and Australian Research Council grant FT0991594.Additional details
- Eprint ID
- 93004
- Resolver ID
- CaltechAUTHORS:20190220-104312716
- CCF-0830511
- NSF
- CNS-0911041
- NSF
- CNS-0846025
- NSF
- W911NF-08-1-0233
- Army Research Office (ARO)
- Microsoft Research
- Caltech Lee Center for Advanced Networking
- FT0991594
- Australian Research Council
- Created
-
2019-02-20Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field