Pith. sign in

REVIEW 1 cited by

Network Intent Decomposition and Optimization for Energy-Aware Radio Access Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.18386 v1 pith:EROTIOLG submitted 2024-04-29 cs.NI

classification cs.NI
keywords networkintentdecompositionoptimizationaccessalgorithmdiverseenergy-aware
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With recent advancements in the sixth generation (6G) communication technologies, more vertical industries have encountered diverse network services. How to reduce energy consumption is critical to meet the expectation of the quality of diverse network services. In particular, the number of base stations in 6G is huge with coupled adjustable network parameters. However, the problem is complex with multiple network objectives and parameters. Network intents are difficult to map to individual network elements and require enhanced automation capabilities. In this paper, we present a network intent decomposition and optimization mechanism in an energy-aware radio access network scenario. By characterizing the intent ontology with a standard template, we present a generic network intent representation framework. Then we propose a novel intent modeling method using Knowledge Acquisition in automated Specification language, which can model the network ontology. To clarify the number and types of network objectives and energy-saving operations, we develop a Softgoal Interdependency Graph-based network intent decomposition model, and thus, a network intent decomposition algorithm is presented. Simulation results demonstrate that the proposed algorithm outperforms without conflict analysis in intent decomposition time. Moreover, we design a deep Q-network-assisted intent optimization scheme to validate the performance gain.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Intent-based Meta-Scheduling in Programmable Networks: A Research Agenda

    cs.NI 2024-12 conditional novelty 5.0 of 10

    A research agenda that sketches how active inference could drive intent-based meta-scheduling across O-RAN's hierarchical schedulers, with no implementation yet.

Pith tools