Original scientific paper

Re-routing Multicast Connections: A Distributed Approach

Roman Novak orcid.org/0000-0001-5757-6703 ; Department of Digital Communications and Networks, Jozef Stefan Institute, Ljubljana, Slovenia
Jože Rugelj ; Department of Digital Communications and Networks, Jozef Stefan Institute, Ljubljana, Slovenia
Gorazd Kandus ; Department of Digital Communications and Networks, Jozef Stefan Institute, Ljubljana, Slovenia

Abstract

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 implementation in communications networks where only partial information is available to routing nodes.

Keywords

multicast communication; re-routing; distributed algorithm

Hrčak ID:

130485

URI

https://hrcak.srce.hr/130485

Publication date:

30.12.1999.

Visits: 920 *