Loading…

Problem-Adapted Artificial Intelligence for Online Network Optimization

Future 5G wireless networks will rely on agile and automated network management, where the usage of diverse resources must be jointly optimized with surgical accuracy. A number of key wireless network functionalities (e.g., traffic steering, power control) give rise to hard optimization problems. Wh...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-03
Main Authors: Vassilaras, Spyridon, Vigneri, Luigi, Liakopoulos, Nikolaos, Paschos, Georgios S, Destounis, Apostolos, Spyropoulos, Thrasyvoulos, Debbah, Merouane
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Future 5G wireless networks will rely on agile and automated network management, where the usage of diverse resources must be jointly optimized with surgical accuracy. A number of key wireless network functionalities (e.g., traffic steering, power control) give rise to hard optimization problems. What is more, high spatio-temporal traffic variability coupled with the need to satisfy strict per slice/service SLAs in modern networks, suggest that these problems must be constantly (re-)solved, to maintain close-to-optimal performance. To this end, we propose the framework of Online Network Optimization (ONO), which seeks to maintain both agile and efficient control over time, using an arsenal of data-driven, online learning, and AI-based techniques. Since the mathematical tools and the studied regimes vary widely among these methodologies, a theoretical comparison is often out of reach. Therefore, the important question `what is the right ONO technique?' remains open to date. In this paper, we discuss the pros and cons of each technique and present a direct quantitative comparison for a specific use case, using real data. Our results suggest that carefully combining the insights of problem modeling with state-of-the-art AI techniques provides significant advantages at reasonable complexity.
ISSN:2331-8422