Self-learning Routing for Optical Networks - Optical Network Design and Modeling Access content directly
Conference Papers Year : 2020

Self-learning Routing for Optical Networks

Yue-Cai Huang
  • Function : Author
  • PersonId : 1096261
Jie Zhang


It is generally very difficult to optimize the routing policies in optical networks with dynamic traffic. Most widely-used routing policies, e.g., shortest path routing and least congested path (LCP) routing, are heuristic policies. Although the LCP is often regarded as the best-performing adaptive routing policy, we are often eager to know whether there exist better routing policies that surpass these heuristics in performance. In this paper, we propose a framework of reinforcement learning (RL) based routing scheme, that learns routing decisions during the interactions with the environment. With a proposed self-learning method, the RL agent can improve its routing policy continuously. Simulations on a ring-topology metro optical network demonstrate that, the proposed scheme outperforms the LCP routing policy.
Fichier principal
Vignette du fichier
484327_1_En_40_Chapter.pdf (1.07 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03200673 , version 1 (16-04-2021)





Yue-Cai Huang, Jie Zhang, Siyuan Yu. Self-learning Routing for Optical Networks. 23th International IFIP Conference on Optical Network Design and Modeling (ONDM), May 2019, Athens, Greece. pp.467-478, ⟨10.1007/978-3-030-38085-4_40⟩. ⟨hal-03200673⟩
49 View
24 Download



Gmail Facebook X LinkedIn More