6533b86dfe1ef96bd12ca1e1

RESEARCH PRODUCT

Efficient tree construction for the multicast problem

G. Lo ReG. Di Fatta

subject

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniMinimisation (psychology)Mathematical optimizationMulticastHeuristicProcess (computing)STP multicast transmissionNetwork topologySteiner tree problemsymbols.namesakeTree (data structure)symbolsHeuristicsMathematics

description

A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the "hot spot" sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed.

yearjournalcountryeditionlanguage
2002-11-27ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)
https://doi.org/10.1109/its.1998.718470