Distributed multicast routing mechanism for global point-to-point networks

Conventional Steiner tree algorithms have provided good solutions to the problem of multipoint virtual liaison construction in the networks where the complete knowledge of their topology was available in particular network nodes. As integrated service communication networks are growing towards a worldwide global network, the need for a distributed approach emerges where each network node is supposed to know only the topology of its vicinity. The presented distributed algorithm is based on the sequential Takahashi-Matsuyama algorithm (H. Takahashi and A. Matsuyama, 1980) and has been implemented as a set of node algorithms, which interact mutually and make collective decisions concerning multipoint liaison setup. Simulation results have shown that the efficiency of the proposed algorithm is practically identical to that of the distributed Kou-Markovsky-Berman algorithm (L. Kou, G. Markovsky, L. Berman, 1981), whereas it substantially surpasses DKMB as regards time complexity.<
>