GraphCue for SDN Configuration Code Synthesis
By: Haomin Qi, Fengfei Yu, Chengbo Huang
We present GraphCue, a topology-grounded retrieval and agent-in-the-loop framework for automated SDN configuration. Each case is abstracted into a JSON graph and embedded using a lightweight three-layer GCN trained with contrastive learning. The nearest validated reference is injected into a structured prompt that constrains code generation, while a verifier closes the loop by executing the candidate configuration and feeding failures back to the agent. On 628 validation cases, GraphCue achieves an 88.2 percent pass rate within 20 iterations and completes 95 percent of verification loops within 9 seconds. Ablation studies without retrieval or structured prompting perform substantially worse, indicating that topology-aware retrieval and constraint-based conditioning are key drivers of performance.
Similar Papers
Neuro-Symbolic Constrained Optimization for Cloud Application Deployment via Graph Neural Networks and Satisfiability Modulo Theory
Logic in Computer Science
Helps cloud computers place apps faster and cheaper.
Citation-Grounded Code Comprehension: Preventing LLM Hallucination Through Hybrid Retrieval and Graph-Augmented Context
Software Engineering
Helps computers understand code without making up answers.
Graph Queries from Natural Language using Constrained Language Models and Visual Editing
Human-Computer Interaction
Lets anyone ask computers questions about facts.