Mahmoud S. Mayaleh

Placing, routing and admitting multi-domain 6G network slices is an NP-hard online problem, fixed planning strategies reverse rank across topologies, and most rejected requests do have a feasible placement. ORION's hierarchical orchestrator uses two LLM agents to translate service intents and generate abstract placement plans, and records each attempt's network conditions, plan shape and verifier feasibility outcome in an episodic memory that returns to the planner as labelled examples. With selection and execution held fixed on held-out topology families, the memory-equipped planner admits more than both the memory-off and first-in-first-out variants on two seeds, though the magnitude is not established.

Placing, routing and admitting multi-domain 6G network slices is an NP-hard online problem, fixed planning strategies reverse rank across topologies, and most rejected requests do have a feasible placement. ORION's hierarchical orchestrator uses two LLM agents to translate service intents and generate abstract placement plans, and records each attempt's network conditions, plan shape and verifier feasibility outcome in an episodic memory that returns to the planner as labelled examples. With selection and execution held fixed on held-out topology families, the memory-equipped planner admits more than both the memory-off and first-in-first-out variants on two seeds, though the magnitude is not established.