Automatic Design of Telecom Networks with Genetic Algorithms

• URL: http://arxiv.org/abs/2304.00637v1
• Date: Sun, 2 Apr 2023 22:02:58 GMT
• Title: Automatic Design of Telecom Networks with Genetic Algorithms
• Authors: Jo\~ao Correia and Gustavo Gama and Jo\~ao Tiago Guerrinha and Ricardo Cadime and Pedro Antero Carvalhido and Tiago Vieira and Nuno Louren\c{c}o
• Abstract summary: An AI-based solution is proposed to automate network design, which is a task typically done manually by teams of engineers. To alleviate this tiresome task, we proposed a Genetic Algorithm using a two-level representation to design the networks automatically. The results show that our method can save costs and time in finding suitable and better solutions than existing ones.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: With the increasing demand for high-quality internet services, deploying GPON/Fiber-to-the-Home networks is one of the biggest challenges that internet providers have to deal with due to the significant investments involved. Automated network design usage becomes more critical to aid with planning the network by minimising the costs of planning and deployment. The main objective is to tackle this problem of optimisation of networks that requires taking into account multiple factors such as the equipment placement and their configuration, the optimisation of the cable routes, the optimisation of the clients' allocation and other constraints involved in the minimisation problem. An AI-based solution is proposed to automate network design, which is a task typically done manually by teams of engineers. It is a difficult task requiring significant time to complete manually. To alleviate this tiresome task, we proposed a Genetic Algorithm using a two-level representation to design the networks automatically. To validate the approach, we compare the quality of the generated solutions with the handmade design ones that are deployed in the real world. The results show that our method can save costs and time in finding suitable and better solutions than existing ones, indicating its potential as a support design tool of solutions for GPON/Fiber-to-the-Home networks. In concrete, in the two scenarios where we validate our proposal, our approach can cut costs by 31% and by 52.2%, respectively, when compared with existing handmade ones, showcasing and validating the potential of the proposed approach.

Related papers

• TelePlanNet: An AI-Driven Framework for Efficient Telecom Network Planning [8.803399698762853]
  The selection of base station sites is a critical challenge in 5G network planning.<n>Existing AI tools, despite improving efficiency in certain aspects, still struggle to meet the dynamic network conditions.<n>We propose TelePlanNet, an AI-driven framework tailored for the selection of base station sites.
  arXiv  Detail & Related papers  (2025-05-20T02:19:10Z)
• Applications of deep reinforcement learning to urban transit network design [0.0]
  This thesis concerns the use of reinforcement learning to train neural networks to aid in the design of public transit networks. The Transit Network Design Problem (TNDP) is an optimization problem of considerable practical importance.
  arXiv  Detail & Related papers  (2025-02-25T01:24:20Z)
• Intelligent Mobile AI-Generated Content Services via Interactive Prompt Engineering and Dynamic Service Provisioning [55.641299901038316]
  AI-generated content can organize collaborative Mobile AIGC Service Providers (MASPs) at network edges to provide ubiquitous and customized content for resource-constrained users. Such a paradigm faces two significant challenges: 1) raw prompts often lead to poor generation quality due to users' lack of experience with specific AIGC models, and 2) static service provisioning fails to efficiently utilize computational and communication resources. We develop an interactive prompt engineering mechanism that leverages a Large Language Model (LLM) to generate customized prompt corpora and employs Inverse Reinforcement Learning (IRL) for policy imitation.
  arXiv  Detail & Related papers  (2025-02-17T03:05:20Z)
• Learning for Cross-Layer Resource Allocation in MEC-Aided Cell-Free Networks [71.30914500714262]
  Cross-layer resource allocation over mobile edge computing (MEC)-aided cell-free networks can sufficiently exploit the transmitting and computing resources to promote the data rate. Joint subcarrier allocation and beamforming optimization are investigated for the MEC-aided cell-free network from the perspective of deep learning.
  arXiv  Detail & Related papers  (2024-12-21T10:18:55Z)
• Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratch [72.26822499434446]
  Auto-Train-Once (ATO) is an innovative network pruning algorithm designed to automatically reduce the computational and storage costs of DNNs. We provide a comprehensive convergence analysis as well as extensive experiments, and the results show that our approach achieves state-of-the-art performance across various model architectures.
  arXiv  Detail & Related papers  (2024-03-21T02:33:37Z)
• Enabling AI-Generated Content (AIGC) Services in Wireless Edge Networks [68.00382171900975]
  In wireless edge networks, the transmission of incorrectly generated content may unnecessarily consume network resources. We present the AIGC-as-a-service concept and discuss the challenges in deploying A at the edge networks. We propose a deep reinforcement learning-enabled algorithm for optimal ASP selection.
  arXiv  Detail & Related papers  (2023-01-09T09:30:23Z)
• Cost-Effective Two-Stage Network Slicing for Edge-Cloud Orchestrated Vehicular Networks [21.651539981330355]
  We study a network slicing problem for edge-cloud orchestrated vehicular networks. We develop a Two timescAle netWork Slicing (TAWS) algorithm by collaboratively integrating reinforcement learning (RL) and optimization methods. Simulation results show that the TAWS can effectively reduce the network slicing cost as compared to the benchmark scheme.
  arXiv  Detail & Related papers  (2022-12-31T06:03:14Z)
• Neighbor Auto-Grouping Graph Neural Networks for Handover Parameter Configuration in Cellular Network [47.29123145759976]
  We propose a learning-based framework for handover parameter configuration. First, we introduce a novel approach to imitate how the network responds to different network states and parameter values. During the parameter configuration stage, instead of solving the global optimization problem, we design a local multi-objective optimization strategy.
  arXiv  Detail & Related papers  (2022-12-29T18:51:36Z)
• Multi-Objective Provisioning of Network Slices using Deep Reinforcement Learning [5.074839768784803]
  A real-time Network Slice Provisioning (NSP) problem is modeled as an online Multi-Objective Programming Optimization (MOIPO) problem. We approximate the solution of the MOIPO problem by applying the Proximal Policy Optimization (PPO) method to the traffic demand prediction. Our simulation results show the effectiveness of the proposed method compared to the state-of-the-art MOIPO solvers with a lower SLA violation rate and network operation cost.
  arXiv  Detail & Related papers  (2022-07-27T23:04:22Z)
• AI in 6G: Energy-Efficient Distributed Machine Learning for Multilayer Heterogeneous Networks [7.318997639507269]
  We propose a novel layer-based HetNet architecture which distributes tasks associated with different machine learning approaches across network layers and entities. Such a HetNet boasts multiple access schemes as well as device-to-device (D2D) communications to enhance energy efficiency.
  arXiv  Detail & Related papers  (2022-06-04T22:03:19Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Offline Contextual Bandits for Wireless Network Optimization [107.24086150482843]
  In this paper, we investigate how to learn policies that can automatically adjust the configuration parameters of every cell in the network in response to the changes in the user demand. Our solution combines existent methods for offline learning and adapts them in a principled way to overcome crucial challenges arising in this context.
  arXiv  Detail & Related papers  (2021-11-11T11:31:20Z)
• Q-Learning for Conflict Resolution in B5G Network Automation [0.9625436987364907]
  This work explores pervasive intelligence for conflict resolution in network automation, as an alternative to centralized orchestration. A Q-Learning decentralized approach to network automation is proposed, and an application to network slice auto-scaling is designed and evaluated.
  arXiv  Detail & Related papers  (2021-07-28T11:00:16Z)
• Multi-Exit Semantic Segmentation Networks [78.44441236864057]
  We propose a framework for converting state-of-the-art segmentation models to MESS networks. specially trained CNNs that employ parametrised early exits along their depth to save during inference on easier samples. We co-optimise the number, placement and architecture of the attached segmentation heads, along with the exit policy, to adapt to the device capabilities and application-specific requirements.
  arXiv  Detail & Related papers  (2021-06-07T11:37:03Z)

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.