Center Placement Algorithms for Large Multicast Groups
A. S. Weigmann, Jörg Nonnenmacher, Ernst W. Biersack · 1997
An increasing number of distributed applications require a specific form of multicast called dissemination, in which a single source reliably transfers data to multiple receivers. Reliability leads for large groups of receivers (100s or 1000s of participants) to the problem of feedback implosion at the source and to a decrease of transmission efficiency. The cluster approach was identified to have excellent scalability with the number of receivers. It partitions the multicast delivery tree into clusters, where a representative in the cluster called center is used for local feedback processing and local transmission. Up to now, clustering/center placement has been done administratively or based on network addresses. Needed are center placement algorithms, allowing the introduction of placement criteria based on the network topology and on delay. In this work, three center placement algorithms designed for static multicast groups are presented and simulation results are shown in order to asses their performance.