Network Aware Compute and Memory Allocation in Optically Composable Data
Centres with Deep Reinforcement Learning and Graph Neural Networks
- URL: http://arxiv.org/abs/2211.02466v1
- Date: Wed, 26 Oct 2022 09:46:50 GMT
- Title: Network Aware Compute and Memory Allocation in Optically Composable Data
Centres with Deep Reinforcement Learning and Graph Neural Networks
- Authors: Zacharaya Shabka, Georgios Zervas
- Abstract summary: Resource-disaggregated data centre architectures promise a means of pooling resources remotely within data centres.
We show how this can be done using an optically switched circuit circuit backbone in the data centre network (DCN)
We show how emphdeep reinforcement learning can be used to learn effective emphnetwork-aware and emphtopologically-scalable allocation policies end-to-end.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Resource-disaggregated data centre architectures promise a means of pooling
resources remotely within data centres, allowing for both more flexibility and
resource efficiency underlying the increasingly important
infrastructure-as-a-service business. This can be accomplished by means of
using an optically circuit switched backbone in the data centre network (DCN);
providing the required bandwidth and latency guarantees to ensure reliable
performance when applications are run across non-local resource pools. However,
resource allocation in this scenario requires both server-level \emph{and}
network-level resource to be co-allocated to requests. The online nature and
underlying combinatorial complexity of this problem, alongside the typical
scale of DCN topologies, makes exact solutions impossible and heuristic based
solutions sub-optimal or non-intuitive to design. We demonstrate that
\emph{deep reinforcement learning}, where the policy is modelled by a
\emph{graph neural network} can be used to learn effective \emph{network-aware}
and \emph{topologically-scalable} allocation policies end-to-end. Compared to
state-of-the-art heuristics for network-aware resource allocation, the method
achieves up to $20\%$ higher acceptance ratio; can achieve the same acceptance
ratio as the best performing heuristic with $3\times$ less networking resources
available and can maintain all-around performance when directly applied (with
no further training) to DCN topologies with $10^2\times$ more servers than the
topologies seen during training.
Related papers
- Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning [69.00997996453842]
We propose a deep Reinforcement Learning approach to learn a joint Admission Control and Resource Allocation policy for virtual network embedding.
We show that HRL-ACRA outperforms state-of-the-art baselines in terms of both the acceptance ratio and long-term average revenue.
arXiv Detail & Related papers (2024-06-25T07:42:30Z) - Double Deep Q-Learning-based Path Selection and Service Placement for
Latency-Sensitive Beyond 5G Applications [11.864695986880347]
This paper studies the joint problem of communication and computing resource allocation, dubbed CCRA, to minimize total cost.
We formulate the problem as a non-linear programming model and propose two approaches, dubbed B&B-CCRA and WF-CCRA, based on the Branch & Bound and Water-Filling algorithms.
Numerical simulations show that B&B-CCRA optimally solves the problem, whereas WF-CCRA delivers near-optimal solutions in a substantially shorter time.
arXiv Detail & Related papers (2023-09-18T22:17:23Z) - Adaptive Resource Allocation for Virtualized Base Stations in O-RAN with
Online Learning [60.17407932691429]
Open Radio Access Network systems, with their base stations (vBSs), offer operators the benefits of increased flexibility, reduced costs, vendor diversity, and interoperability.
We propose an online learning algorithm that balances the effective throughput and vBS energy consumption, even under unforeseeable and "challenging'' environments.
We prove the proposed solutions achieve sub-linear regret, providing zero average optimality gap even in challenging environments.
arXiv Detail & Related papers (2023-09-04T17:30:21Z) - Equitable-FL: Federated Learning with Sparsity for Resource-Constrained
Environment [10.980548731600116]
We propose a sparse form of federated learning that performs well in a Resource Constrained Environment.
Our goal is to make learning possible, regardless of a node's space, computing, or bandwidth scarcity.
Results obtained from experiments performed for training convolutional neural networks validate the efficacy of Equitable-FL.
arXiv Detail & Related papers (2023-09-02T08:40:17Z) - Multi Agent DeepRL based Joint Power and Subchannel Allocation in IAB
networks [0.0]
Integrated Access and Backhauling (IRL) is a viable approach for meeting the unprecedented need for higher data rates of future generations.
In this paper, we show how we can use Deep Q-Learning Network to handle problems with huge action spaces associated with fractional nodes.
arXiv Detail & Related papers (2023-08-31T21:30:25Z) - CLARA: A Constrained Reinforcement Learning Based Resource Allocation
Framework for Network Slicing [19.990451009223573]
Network slicing is proposed as a promising solution for resource utilization in 5G and future networks.
We formulate the problem as a Constrained Markov Decision Process (CMDP) without knowing models and hidden structures.
We propose to solve the problem using CLARA, a Constrained reinforcement LeArning based Resource Allocation algorithm.
arXiv Detail & Related papers (2021-11-16T11:54:09Z) - Nara: Learning Network-Aware Resource Allocation Algorithms for Cloud
Data Centres [0.0]
Nara is a framework based on reinforcement learning and graph neural networks (GNN) to learn network-aware allocation policies.
It can accept up to 33% more requests than the best baseline when deployed on DCNs with up to the order of $10times more compute nodes than the DCN seen during training.
It is able to maintain its policy's performance on DCNs with the order of $100times$ more servers than seen during training.
arXiv Detail & Related papers (2021-06-04T10:56:49Z) - Resource Allocation via Model-Free Deep Learning in Free Space Optical
Communications [119.81868223344173]
The paper investigates the general problem of resource allocation for mitigating channel fading effects in Free Space Optical (FSO) communications.
Under this framework, we propose two algorithms that solve FSO resource allocation problems.
arXiv Detail & Related papers (2020-07-27T17:38:51Z) - Resource Allocation via Graph Neural Networks in Free Space Optical
Fronthaul Networks [119.81868223344173]
This paper investigates the optimal resource allocation in free space optical (FSO) fronthaul networks.
We consider the graph neural network (GNN) for the policy parameterization to exploit the FSO network structure.
The primal-dual learning algorithm is developed to train the GNN in a model-free manner, where the knowledge of system models is not required.
arXiv Detail & Related papers (2020-06-26T14:20:48Z) - Deep Adaptive Inference Networks for Single Image Super-Resolution [72.7304455761067]
Single image super-resolution (SISR) has witnessed tremendous progress in recent years owing to the deployment of deep convolutional neural networks (CNNs)
In this paper, we take a step forward to address this issue by leveraging the adaptive inference networks for deep SISR (AdaDSR)
Our AdaDSR involves an SISR model as backbone and a lightweight adapter module which takes image features and resource constraint as input and predicts a map of local network depth.
arXiv Detail & Related papers (2020-04-08T10:08:20Z) - Large-Scale Gradient-Free Deep Learning with Recursive Local
Representation Alignment [84.57874289554839]
Training deep neural networks on large-scale datasets requires significant hardware resources.
Backpropagation, the workhorse for training these networks, is an inherently sequential process that is difficult to parallelize.
We propose a neuro-biologically-plausible alternative to backprop that can be used to train deep networks.
arXiv Detail & Related papers (2020-02-10T16:20:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.