Dynamic multicast routing algorithm using predetermined path search

Takuya Asaka*, Takumi Miyosh, Yoshiaki Tanaka

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


With conventional dynamic routing algorithms, many query messages are required in a distributed environment . for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

Original languageEnglish
Pages (from-to)1128-1134
Number of pages7
JournalIEICE Transactions on Communications
Issue number5
Publication statusPublished - 2000 Jan 1
Externally publishedYes


  • Algorithm
  • Dynamic
  • Multicast
  • Routing

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Dynamic multicast routing algorithm using predetermined path search'. Together they form a unique fingerprint.

Cite this