AI summary · arXiv: 2102.09426v1 · cs.NI

Dynamic VNF Placement, Resource Allocation and Traffic Routing in 5G

Morteza Golkarifard, Carla Fabiana Chiasserini, Francesco Malandrino, Ali Movaghar

Original paper · DOI Submitted to arXiv on 18 Feb. 2021 Computer Networks, 2021 License: NONEXCLUSIVE-DISTRIB 1.0

The essentials

  • Growing need to support a wide range of vertical services with different KPIs in 5G networks
  • Enabling technologies like software-defined networking and network function virtualization can achieve this
  • Efficiently allocating resources while considering limited resources and costs is a critical challenge for network operators
  • Highly varying nature of service requests over time necessitates a solution that can dynamically generate and terminate requests
  • Joint decisions for request admission, resource activation, VNF placement, resource allocation, and traffic routing are needed
  • Real-world aspects such as setup times of virtual machines are taken into account to maximize mobile network operator profit
  • Optimization problem provides an optimum solution for small-sized problems with complete knowledge of arrival and departure times
  • Practical heuristic solution only requires knowledge about the next time period and can be applied to realistically-sized scenarios
  • Heuristic solution outperforms state-of-the-art online approach and comes close to achieving optimal results
  • Study focuses on addressing challenges associated with dynamic VNF placement, resource allocation, and traffic routing in 5G networks

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: 5G networks KPIs VNF placement resource allocation traffic routing

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
In the field of 5G networks, there is a growing need to support a wide range of vertical services with different key performance indicators (KPIs). This can be achieved through the use of enabling technologies like software-defined networking and network function virtualization. However, efficiently allocating available resources to meet service requests while considering limited resources and costs poses a critical challenge for network operators. One major difficulty lies in the highly varying nature of these requests over time, necessitating a solution that can dynamically generate and terminate requests. To address this issue, researchers aim to make joint decisions for request admission, resource activation, virtual network function (VNF) placement, resource allocation, and traffic routing. Real-world aspects such as the setup times of virtual machines are taken into account with the ultimate goal of maximizing mobile network operator profit. To tackle this problem, researchers first formulate an optimization problem that provides an optimum solution for small-sized problems when complete knowledge of arrival and departure times of requests throughout the system lifespan is available. However, they also propose a practical heuristic solution that only requires knowledge about the next time period and can be applied to realistically-sized scenarios. The performance of these solutions is evaluated using real-world services and large-scale network topologies. The results show that their heuristic solution outperforms a state-of-the-art online approach and comes close to achieving optimal results. Overall, this study focuses on addressing the challenges associated with dynamic VNF placement, resource allocation, and traffic routing in 5G networks. By considering real-world factors such as setup times of virtual machines and proposing efficient solutions for request admission and resource activation , it contributes to maximizing mobile network operator profit while meeting diverse service requirements.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts
Journal club Premium+ Slides to present it
For journalists Premium+ Press kit and hype check

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.