File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Learning-Based Two-Tiered Online Optimization of Region-Wide Datacenter Resource Allocation

TitleLearning-Based Two-Tiered Online Optimization of Region-Wide Datacenter Resource Allocation
Authors
Keywordscapacity reservation
Cloud computing
deep reinforcement learning
explainable reinforcement learning
Issue Date2025
Citation
IEEE Transactions on Network and Service Management, 2025, v. 22, n. 1, p. 572-581 How to Cite?
AbstractOnline optimization of resource management for large-scale data centers and infrastructures to meet dynamic capacity reservation demands and various practical constraints (e.g., feasibility and robustness) is a very challenging problem. Mixed Integer Programming (MIP) approaches suffer from recognized limitations in such a dynamic environment, while learning-based approaches may face with prohibitively large state/action spaces. To this end, this paper presents a novel two-tiered online optimization to enable a learning-based Resource Allowance System (RAS). To solve optimal server-to-reservation assignment in RAS in an online fashion, the proposed solution leverages a reinforcement learning (RL) agent to make high-level decisions, e.g., how much resource to select from the Main Switch Boards (MSBs), and then a low-level Mixed Integer Linear Programming (MILP) solver to generate the local server-to-reservation mapping, conditioned on the RL decisions. We take into account fault tolerance, server movement minimization, and network affinity requirements and apply the proposed solution to large-scale RAS problems. To provide interpretability, we further train a decision tree model to explain the learned policies and to prune unreasonable corner cases at the low-level MILP solver, resulting in further performance improvement. Extensive evaluations show that our two-tiered solution outperforms baselines such as pure MIP solver by over 15% while delivering 100× speedup in computation.
Persistent Identifierhttp://hdl.handle.net/10722/360934

 

DC FieldValueLanguage
dc.contributor.authorChen, Chang Lin-
dc.contributor.authorZhou, Hanhan-
dc.contributor.authorChen, Jiayu-
dc.contributor.authorPedramfar, Mohammad-
dc.contributor.authorLan, Tian-
dc.contributor.authorZhu, Zheqing-
dc.contributor.authorZhou, Chi-
dc.contributor.authorMauri Ruiz, Pol-
dc.contributor.authorKumar, Neeraj-
dc.contributor.authorDong, Hongbo-
dc.contributor.authorAggarwal, Vaneet-
dc.date.accessioned2025-09-16T04:13:30Z-
dc.date.available2025-09-16T04:13:30Z-
dc.date.issued2025-
dc.identifier.citationIEEE Transactions on Network and Service Management, 2025, v. 22, n. 1, p. 572-581-
dc.identifier.urihttp://hdl.handle.net/10722/360934-
dc.description.abstractOnline optimization of resource management for large-scale data centers and infrastructures to meet dynamic capacity reservation demands and various practical constraints (e.g., feasibility and robustness) is a very challenging problem. Mixed Integer Programming (MIP) approaches suffer from recognized limitations in such a dynamic environment, while learning-based approaches may face with prohibitively large state/action spaces. To this end, this paper presents a novel two-tiered online optimization to enable a learning-based Resource Allowance System (RAS). To solve optimal server-to-reservation assignment in RAS in an online fashion, the proposed solution leverages a reinforcement learning (RL) agent to make high-level decisions, e.g., how much resource to select from the Main Switch Boards (MSBs), and then a low-level Mixed Integer Linear Programming (MILP) solver to generate the local server-to-reservation mapping, conditioned on the RL decisions. We take into account fault tolerance, server movement minimization, and network affinity requirements and apply the proposed solution to large-scale RAS problems. To provide interpretability, we further train a decision tree model to explain the learned policies and to prune unreasonable corner cases at the low-level MILP solver, resulting in further performance improvement. Extensive evaluations show that our two-tiered solution outperforms baselines such as pure MIP solver by over 15% while delivering 100× speedup in computation.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Network and Service Management-
dc.subjectcapacity reservation-
dc.subjectCloud computing-
dc.subjectdeep reinforcement learning-
dc.subjectexplainable reinforcement learning-
dc.titleLearning-Based Two-Tiered Online Optimization of Region-Wide Datacenter Resource Allocation-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TNSM.2024.3484213-
dc.identifier.scopuseid_2-s2.0-105001078273-
dc.identifier.volume22-
dc.identifier.issue1-
dc.identifier.spage572-
dc.identifier.epage581-
dc.identifier.eissn1932-4537-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats