Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Reinforcement-learning-based path planning in multilayer elastic optical networks [Invited]

Not Accessible

Your library or personal account may give you access

Abstract

This paper reports our study on the multilayer path (MLP) planning method in multilayer networks to achieve the flexible accommodation of large-capacity and diversified traffic. In addition to traffic grooming of sub-lambda paths, MLP design requires optimal selection of the operational mode. In this paper, we discuss MLP design methods that use reinforcement learning and auxiliary graphs to achieve MLP designs that satisfy various requirements such as cost, energy, and low blocking probability. We introduce a heuristic MLP planning method using auxiliary graphs. This method can determine link weights of auxiliary graphs to comply with arbitrary predefined policies; it yields MLPs whose characteristics satisfy the MLP requirements. We then describe an approach to optimize the weights of the auxiliary graph using reinforcement learning. In simulations, we evaluate the number of successfully allocated MLP paths, the required number of transceivers, and the capacity distribution of optical paths in a scenario where MLP requests are generated sequentially. The quantitative results show that our MLP design method can adaptively adjust the link weights of the auxiliary graphs under various network conditions. This can significantly improve the performance compared to heuristic design methods that assume fixed policies.

© 2023 Optica Publishing Group

Full Article  |  PDF Article
More Like This
Deep reinforcement learning for proactive spectrum defragmentation in elastic optical networks

Ehsan Etezadi, Carlos Natalino, Renzo Diaz, Anders Lindgren, Stefan Melin, Lena Wosinska, Paolo Monti, and Marija Furdek
J. Opt. Commun. Netw. 15(10) E86-E96 (2023)

Techniques for applying reinforcement learning to routing and wavelength assignment problems in optical fiber communication networks

Josh W. Nevin, Sam Nallaperuma, Nikita A. Shevchenko, Zacharaya Shabka, Georgios Zervas, and Seb J. Savory
J. Opt. Commun. Netw. 14(9) 733-748 (2022)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (10)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (4)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (2)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.