Re-routing Multicast Connections: A Distributed Approach
Roman Novak, Jože Rugelj, Gorazd Kandus · 1999
In virtual-circuit environments that provide a multicast capability, fixed routing algorithms provide solutions that are only efficient initially and for a short time due to dynamic nature of network environments. We propose a re-routing algorithm that continuously rearranges the topology of the initial connection, in response to changes in the destination set and network status. The re-routing algorithm is cost effective and minimally disruptive to the multicast session. It is based on a modified Steiner tree improvement technique, and it has been designed purposely to meet the requirements for distributed im-plementation in communications networks where only partial information is available to routing nodes.