New Distributed Multicast Routing and Its Performance Evaluation
Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka · 2000
. 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. 1 Introduction Future computer-network applications such as teleconferencing or remote collaboration will rely on the ability of networks to provide multicast services. Multicasting is expected to become widely used [1, 2, 3], and is well suited to these services because it uses network resources efficiently. In multicasting, a pointto -multipoint (...