Routing-Led Placement of VNFs in Arbitrary Networks

• URL: http://arxiv.org/abs/2001.11565v1
• Date: Thu, 30 Jan 2020 21:06:15 GMT
• Title: Routing-Led Placement of VNFs in Arbitrary Networks
• Authors: Joseph Billingsley, Ke Li, Wang Miao, Geyong Min, Nektarios Georgalas
• Abstract summary: Virtualisation technology allows for the creation of services by connecting component parts known as virtual network functions (VNFs) Current research on this problem has focussed on placing VNFs and considered routing as a secondary concern. We propose a novel routing-led algorithm and analyse each of the component parts over a range of different topologies.
• Score: 21.790919473654153
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ever increasing demand for computing resources has led to the creation of hyperscale datacentres with tens of thousands of servers. As demand continues to rise, new technologies must be incorporated to ensure high quality services can be provided without the damaging environmental impact of high energy consumption. Virtualisation technology such as network function virtualisation (NFV) allows for the creation of services by connecting component parts known as virtual network functions (VNFs). VNFs cam be used to maximally utilise available datacentre resources by optimising the placement and routes of VNFs, to maintain a high quality of service whilst minimising energy costs. Current research on this problem has focussed on placing VNFs and considered routing as a secondary concern. In this work we argue that the opposite approach, a routing-led approach is preferable. We propose a novel routing-led algorithm and analyse each of the component parts over a range of different topologies on problems with up to 16000 variables and compare its performance against a traditional placement based algorithm. Empirical results show that our routing-led algorithm can produce significantly better, faster solutions to large problem instances on a range of datacentre topologies.

Related papers

• Routing-Led Evolutionary Algorithm for Large-Scale Multi-Objective VNF Placement Problems [7.607144511202278]
  We study how to discover the optimal placement of virtual network functions in large scale data centers.<n>We propose a novel parallel metaheuristic, fast objective functions of the networks and new efficient data structures.<n>Using these new concepts, we are able to find high quality solutions for data centres with up to 64,000 servers.
  arXiv  Detail & Related papers  (2025-12-17T11:37:07Z)
• Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems [10.434368470402935]
  optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems.
  arXiv  Detail & Related papers  (2025-01-17T15:10:22Z)
• 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)
• 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)
• Network Aware Compute and Memory Allocation in Optically Composable Data Centres with Deep Reinforcement Learning and Graph Neural Networks [0.0]
  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.
  arXiv  Detail & Related papers  (2022-10-26T09:46:50Z)
• Machine Learning-Based User Scheduling in Integrated Satellite-HAPS-Ground Networks [82.58968700765783]
  Integrated space-air-ground networks promise to offer a valuable solution space for empowering the sixth generation of communication networks (6G) This paper showcases the prospects of machine learning in the context of user scheduling in integrated space-air-ground communications.
  arXiv  Detail & Related papers  (2022-05-27T13:09:29Z)
• Multi Objective Resource Optimization of Wireless Network Based on Cross Domain Virtual Network Embedding [6.019028366261091]
  This paper implements a multi-objective optimization VNE algorithm for wireless network resource allocation. According to the proposed objective formula, we consider the optimization mapping cost, network delay and VNR acceptance rate.
  arXiv  Detail & Related papers  (2022-02-03T07:26:10Z)
• IoV Scenario: Implementation of a Bandwidth Aware Algorithm in Wireless Network Communication Mode [49.734868032441625]
  This paper proposes a bandwidth aware multi domain virtual network embedding algorithm (BA-VNE) The algorithm is mainly aimed at the problem that users need a lot of bandwidth in wireless communication mode. In order to improve the performance of the algorithm, we introduce particle swarm optimization (PSO) algorithm.
  arXiv  Detail & Related papers  (2022-02-03T03:34:06Z)
• Federated Learning over Wireless IoT Networks with Optimized Communication and Resources [98.18365881575805]
  Federated learning (FL) as a paradigm of collaborative learning techniques has obtained increasing research attention. It is of interest to investigate fast responding and accurate FL schemes over wireless systems. We show that the proposed communication-efficient federated learning framework converges at a strong linear rate.
  arXiv  Detail & Related papers  (2021-10-22T13:25:57Z)
• Deep Learning for Radio Resource Allocation with Diverse Quality-of-Service Requirements in 5G [53.23237216769839]
  We develop a deep learning framework to approximate the optimal resource allocation policy for base stations. We find that a fully-connected neural network (NN) cannot fully guarantee the requirements due to the approximation errors and quantization errors of the numbers of subcarriers. Considering that the distribution of wireless channels and the types of services in the wireless networks are non-stationary, we apply deep transfer learning to update NNs in non-stationary wireless networks.
  arXiv  Detail & Related papers  (2020-03-29T04:48:22Z)
• Machine Learning for Performance-Aware Virtual Network Function Placement [3.5558885788605323]
  We develop a machine learning decision tree model that learns from the effective placement of the various Virtual Network Function instances forming a Service Function Chain (SFC) The model takes several performance-related features from the network as an input and selects the placement of the various VNF instances on network servers with the objective of minimizing the delay between dependent VNF instances.
  arXiv  Detail & Related papers  (2020-01-13T14:08:39Z)

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.