New distributed multicast routing and its performance evaluation

Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multi-cast 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
Title of host publicationNETWORKING 2000
Subtitle of host publicationBroadband Communications, High Performance Networking, and Performance of Communication Networks - IFIP-TC6/European Commission International Conference, Proceedings
EditorsGuy Pujolle, Harry Perros, Serge Fdida, Ulf Korner, Ioannis Stavrakakis
PublisherSpringer Verlag
Number of pages12
ISBN (Print)354067506X, 9783540675068
Publication statusPublished - 2000
Externally publishedYes
EventIFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000 - Paris, France
Duration: 2000 May 142000 May 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherIFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'New distributed multicast routing and its performance evaluation'. Together they form a unique fingerprint.

Cite this