The paper introduces TELGEN, a traffic engineering algorithm that uses graph neural networks to predict an optimal TE algorithm rather than a direct solution. TELGEN generalizes across diverse network topologies and traffic patterns, achieving less than a 3% optimality gap on networks up to 5,000 nodes and 3.6 million links, while reducing solving time by up to 84% and training time by up to 79.6% compared to existing methods.
arXiv:2608.28627v1 Announce Type: new Abstract: Designing high-performance tactical wireless networks under realistic operational constraints gives rise to challenging combinatorial optimization prob...
arXiv:2608.23917v1 Announce Type: new Abstract: Common shortest-path algorithms, such as Dijkstra's (SPF), that OSPF uses, provide exact routing solutions but must be recomputed for each network topo...
arXiv:2604.02927v3 Announce Type: replace Abstract: Routing algorithms are crucial for efficient computer network operations, and in many settings they must be able to react to traffic bursts within...
The paper proposes an online learning framework for configuring dynamic constellation topologies in satellite networks, addressing the challenges posed by continuous orbital movement and node maneuvering. It does not rely on predefined orbital plane structures, making it robust to changes caused by satellite maneuvers. Experiments show that the method performs comparably to state‑of‑the‑art offline techniques and can be adapted to constrained online learning, balancing per‑iteration computational cost against convergence speed.
arXiv:2606. 09539v1 Announce Type: new Abstract: Spatio-temporal graph neural networks (STGNNs) have become the dominant approach for traffic prediction, yet their computational requirements pose challenges for practical deployment in intelligent transportation systems (ITS).
arXiv:2503. 03137v3 Announce Type: replace Abstract: Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design.
arXiv:2608. 13212v1 Announce Type: new Abstract: Networked systems, from power grids to traffic networks and cloud clusters, carry loads across nodes with limited capacity.
The paper introduces NICO, a learned 2‑opt local search policy for routing problems that improves upon initial neural solutions by repeatedly applying local moves. NICO addresses three shortcomings of prior policies—incumbent representation, input feature scaling, and move‑gain computation—by using edge‑based tokens without positional encodings, scale‑free features, and exact move gains added to logits. Experiments show that NICO generalizes to larger instances, achieving a 1.1% gap on 1000‑node Euclidean TSP and outperforming both greedy 2‑opt and previous learned policies, while also enhancing tours from constructive and diffusion‑based solvers on road‑network and CVRP benchmarks.
arXiv:2505. 13102v4 Announce Type: replace-cross Abstract: Unlike conventional "black-box" transformers with classical self-attention mechanism, we build a lightweight and interpretable transformer-like neural net by unrolling a mixed-graph-based optimization algorithm to forecast traffic with spatial and temporal dimensions.
arXiv:2607. 14176v1 Announce Type: new Abstract: Reliable, low-latency uplink connectivity is a key requirement for C-V2X networks in dense urban environments, where fast channel variations and blockages often degrade direct vehicle-to-infrastructure links.
arXiv:2607. 26467v1 Announce Type: new Abstract: Traffic prediction is a core task in intelligent transportation systems, supporting applications such as adaptive signal control, route guidance, and ride-hailing dispatch.
Traffic prediction is a core task in intelligent transportation systems, supporting applications such as adaptive signal control, route guidance, and ride-hailing dispatch. Deep learning models, including graph convolutional networks, recurrent networks, and Transformers, achieve strong results on standard benchmarks, but their architectures are designed by hand, requiring significant expert effort and producing models that often generalize poorly across cities and datasets.