본문 바로가기
  • Home

solving Based Multicast Routing Problems Using A Simulated annealing Algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2004, 9(3), pp.189-194
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Kang, Myung-Ju 1

1청강문화산업대학교

Candidate

ABSTRACT

This paper proposes a Simulated Annealing(SA) algorithm for cluster-based Multicast Routing problems. Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is, the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. Multicast tree can be constructed by minimum-cost Steiner tree. In this paper, an SA algorithm is used in the minimum-cost Steiner tree. Especially, in SA, the cooling schedule is an important factor for the algorithm. Hence, in this paper, a cooling schedule is proposed for SA for multicast routing problems and analyzed the simulation results.

Citation status

* References for papers published after 2022 are currently being built.