Algorithms for dynamic capacity provisioning Article Swipe
Lachlan L. H. Andrew
,
Minghong Lin
,
Adam Wierman
,
Zhenhua Liu
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.25916/sut.26283205
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.25916/sut.26283205
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.
Related Topics To Compare & Contrast
Concepts
Provisioning
Server
Computer science
Data center
Power consumption
Load balancing (electrical power)
Distributed computing
Computer network
Power (physics)
Algorithm
Mathematics
Physics
Quantum mechanics
Geometry
Grid
Metadata
- Type
- article
- Language
- en
- Landing Page
- http://hdl.handle.net/1959.3/235742
- OA Status
- green
- Cited By
- 4
- References
- 6
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W1960888338
All OpenAlex metadata
Raw OpenAlex JSON
No additional metadata available.