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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we consider a logical topology design problem on DWDM optical networks where the traffic is quantized at sub-wavelength resolution and the critical factor to determine the fitness of a solution is the number of lightpaths required, that is proportional to the number of hardware modules to handle the traffic. The problem has been shown to be NP-hard. We review some of the previous work in the field, examine a number of regular but unsatisfactory solutions and describe a greedy-based iterated heuristic belonging to the GRASP family to minimize the number of lightpaths. At the end we present some experimental results that compare our GRASP heuristic with other greedy-based methods and with regular topologies.

A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies