A Caltech Library Service

Algorithms for dynamic capacity provisioning

Andrew, Lachlan L. H. and Lin, Minghong and Wierman, Adam and Liu, Zhenhua (2012) Algorithms for dynamic capacity provisioning. In: 10th International Conference on Optical Internet (COIN2012). IEEE , Piscataway, NJ, pp. 73-74. ISBN 978-4-88552-263-5.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
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.
Funding AgencyGrant Number
Army Research Office (ARO)W911NF-08-1-0233
Microsoft ResearchUNSPECIFIED
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Australian Research CouncilFT0991594
Record Number:CaltechAUTHORS:20190220-104312716
Persistent URL:
Official Citation:L. L. H. Andrew, M. Lin, A. Wierman and Z. Liu, "Algorithms for dynamic capacity provisioning," The 10th International Conference on Optical Internet (COIN2012), Yokohama, Kanagawa, 2012, pp. 73-74.
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93004
Deposited By: Tony Diaz
Deposited On:20 Feb 2019 18:53
Last Modified:03 Oct 2019 20:50

Repository Staff Only: item control page