This paper proposes a new heuristic for the dynamic version of the Steiner Tree Problem in Networks (SPN). The heuristic adopts a Random Neural Network (RNN) to improve solutions obtained by previously proposed dynamic algorithms. The Random Neural Network model is adapted to map the intrinsic features of the multicast transmission on a computer network. Exhaustive experiments are carried out to validate the proposed methodology.
A Random Neural Network for the Dynamic Multicast Problem
Lo Re Giuseppe;Urso Alfonso
2004
Abstract
This paper proposes a new heuristic for the dynamic version of the Steiner Tree Problem in Networks (SPN). The heuristic adopts a Random Neural Network (RNN) to improve solutions obtained by previously proposed dynamic algorithms. The Random Neural Network model is adapted to map the intrinsic features of the multicast transmission on a computer network. Exhaustive experiments are carried out to validate the proposed methodology.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
