Skip to content

SyOpt: Constrained Genetic Algorithm for Near-Optimal Resilient Routing Synthesis

· 0 citations · 53 references

TL;DR

The effectiveness of SyOpt for minimizing link congestion for routings perfectly resilient for up to one link failure is demonstrated and its potential for continuous application in online monitoring and timely routing optimization, under dynamically fluctuating traffic demands is discussed.

View source

Similar papers

Conference Aug 2026

Distance-Aware Cache Server Placement for Anycast CDNs via Genetic Algorithm

In anycast content delivery networks (CDNs), client requests are naturally routed to the topologically closest cache server (CS) via the border gateway protocol (BGP). However, BGP routing policies frequently cause path inflation, directing clients to geographically distant servers and severely degrading delivery laten...

Futo Masai, Noriaki Kamiyama · 0 citations
#machine learning Preprint Sep 2026

Validity-Preserving Hierarchical RL for Joint Routing and Switch Placement in EDA

Routing and switch placement are fundamental combinatorial optimization problems in chip design, requiring the joint optimization of routing topology and physical placement under strict structural, geometric and logical constraints. Existing approaches typically rely on carefully engineered heuristics that incorporate...

Dorian Gailhard, Ugo Lecerf, Enzo Tartaglione et al. · 0 citations
Book Open access Sep 2026

Bypass-Enabled Topology-Agnostic Multicast Router for Fault-Tolerant Network-on-Chips

BEAM is introduced, which integrates three key components: a sequential topology embedding algorithm that employs a heuristic search with Warnsdorff’s rule to construct a near-Hamiltonian path, abstracting any arbitrary physical network into a unified logical sequence, enabling concurrent packet forwarding to improve t...

Juntae Jung, Tae Hee Han · 0 citations
Open access Sep 2026

An Energy-Integrated Hybrid Cheetah Chase Framework for Adaptive Delay Optimization in Dynamic Network Routing

Minimizing delay in selected paths is a critical challenge in modern network environments, particularly in large-scale and dynamic topologies. Traditional routing algorithms often struggle to provide optimal solutions for delay-sensitive applications due to their reliance on static metrics and limited adaptability. To...

Goudhaman Marimuthu · 0 citations
Preprint Aug 2026

FABO: Agent-Guided Discovery of Joint Breakpoint Optimization for Timing-Driven Routing Trees

Whether language-model-guided search can discover a constructive algorithm that improves on SALT is asked, and an agent framework that combines parallel exploration with independent checking is developed that combines parallel exploration with independent checking is developed.

Shang Liu, Wenji Fang, Jing Wang et al. · 0 citations
Open access Aug 2026

LLM-Assisted Initial Population Generation for Multi-Objective Joint Service Placement and Traffic Routing in 6G Networks

In forthcoming 6G networks beyond 5G, services with increasingly stringent performance requirements are expected to emerge, requiring dynamic and flexible service placement and traffic routing. Furthermore, the integration of non-terrestrial networks for global coverage introduces continuously changing network topologi...

Doyoung Lee · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.