Multicast routing algorithm based on extended simulated annealing algorithm
Jin-Ku Jeong, Sung-Ok Kim, Chihwa Song · International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering · 2005
In this paper, we propose a method that is able to find a good multicast routing tree in a wide area network. The problem domain that we should solve is modeled as a weighted, undirected graph. The graph that represents a wide area network has three node type, a server that sends the same data to the recipients, some nodes that do not request data to the server and the rest that don't need data. Our method uses the extended simulated annealing algorithm [ESA].