Back to AI News
arxiv

ORION: An Outcome-Driven LLM Advisor for RL-Based Multi-Domain 6G Slice Placement

ORION introduces a hierarchical orchestrator that uses two LLM agents to translate service intents and generate abstract placement plans for 6G network slices across administrative domains. A cooperative multi-agent RL coordinator selects cross-domain partitions while per-domain agents handle function placement. The key innovation is an outcome-driven episodic memory that records network conditions, proposed plans, and verified feasibility outcomes, feeding successes and failures back to the planner. In controlled experiments, this memory improves admission rates by 4.6–11.5 percentage points over the same planner without memory.

AI Brief

Provides a concrete, measurable improvement in 6G network orchestration by combining LLM planning with RL and a novel outcome-driven memory mechanism.

arXiv:2610.41563v1 Announce Type: cross Abstract: Deploying 6G network slices across administrative domains requires an online decision for each arriving request: which domain hosts each virtual network function, how traffic crosses domain boundaries, and whether the slice is admitted. This joint decision problem is NP-hard under continuous arrivals. Experiments on a parametrized family of multi-domain topologies show that no fixed planning strategy dominates across all regimes: the performance ranking reverses between topology classes, and feasible placements exist for most rejected requests but remain undiscovered. These findings identify the plan layer as the decisive performance lever. We introduce ORION, a hierarchical orchestrator in which two LLM agents translate service intents into structured requests and generate abstract placement plans. A cooperative multi-agent RL coordinator selects the cross-domain partition, treating the plan as a persistent soft prior, while per-domain agents place the functions. ORION main contribution lies at the plan layer: an outcome-driven episodic memory that records, for each completed attempt, the network-condition profile, the proposed plan, and its verified feasibility outcome. The memory feeds verified successes and labelled failures back to the planner, thereby closing the adaptation loop using deployment feasibility rather than a scalar reward assigned to the planner's own proposals. To isolate the effect of the plan quality, we evaluate the planner on held-out topology families while keeping the downstream selection and execution mechanisms fixed. Under this controlled setting, the proposed memory improves admission by $4.6$--$11.5$ percentage points over the same planner without memory, while importance-based retention accounts for most of the improvement over a first-in-first-out store.
Be the first to rate this article.

Comments & Questions (0)

Captcha
Please be respectful — let's keep the conversation friendly.

No comments yet

Be the first to comment!