Title :
Efficient tree construction for the multicast problem
Author :
Di Fatta, Giuseppe ; Lo Re, G.
Author_Institution :
CERE, CNR, Palermo, Italy
Abstract :
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
Keywords :
minimisation; multicast communication; network topology; trees (mathematics); Steiner minimal tree; approximations; heuristic; multicast problem; optimal solutions; solution trees; stirring process; tree construction; Asynchronous transfer mode; Computational Intelligence Society; Costs; Frame relay; Joining processes; Minimization methods; Packet switching; Polynomials; Steiner trees; Videoconference;
Conference_Titel :
Telecommunications Symposium, 1998. ITS '98 Proceedings. SBT/IEEE International
Conference_Location :
Sao Paulo
Print_ISBN :
0-7803-5030-8
DOI :
10.1109/ITS.1998.718470
