English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The main idea of the research is the implementation of the maximum flow algorithm for ordering requests in the Routing and Wavelength Assignment (RWA) problem. In the literature the problem consists in meeting the demands defined in the virtual topology, being possible to highlight two approaches. The first variant is MIN-RWA, where the overall goal is to fulfill requests with the shortest number of wavelengths and the other variation is MAX-RWA, which aims to maximize the number of requests met with a fixed number of wavelengths. In this study will be considered the MIN-RWA. This study addresses an adaptation of the method proposed by cite skorin2007routing, which consists of ordering through the minimum path length of each request. By implementing the maximum flow method, one can propose two new methods which were the combinations of the maximum flow algorithms and the minimum path algorithms, along with three ways to define the graph creation method. The results obtained with the variations were compared with what is already defined in the literature in order to measure the gains of the present work.

UTILIZAÇÃO DE FLUXO MAXIMO PARA ORDENAÇÃO DE REQUISIÇÃO DO PROBLEMA DE ROTEAMENTO E ALOCAÇÃO DE COMPRIMENTOS DE ONDA