Distributed multicast routing in point-to-point networks

Abstract

The distributed algorithm for a multicast connection set-up, based on the &cheapest insertion' heuristic, is reviewed. The multicast routing problem is translated into a Steiner tree problem in point-to-point networks where nodes have only a limited knowledge about the network. A solution is proposed in which the time complexity and the amount of information exchanged between network nodes are proportional to the number of members of the multicast group. The Steiner tree is constructed by means of a distributed table-passing algorithm. The analysis of the algorithm presented, backed up by simulation results, con"rms its superiority over the algorithm based on &waving technique'. Scope and purposeMulticasting is a mechanism used in communication networks that allows distribution of information from a single source to multiple destinations. The problem of "nding a multicast connection for a static group of communicating entities in connection-oriented point-to-point network can be formulated in graph theory as a minimum Steiner tree problem. Due to NP-completeness of the Steiner tree problem multicast, routing algorithms are based on heuristics. The diversity of network environments and the lack of centralised information about network topology require an e!ective distribution of the multicast routing algorithms among the network nodes. This article presents an alternative to the distributed algorithm proposed by Rugelj and Klavzar that implements the same heuristics for the construction of a minimum cost multicast connection in point-to-point networks. The present algorithm constitutes a substantial improvement over that previously proposed with regard to running time and the amount of the information exchanged between network nodes.

A distributed multicast routing algorithm for real-time applications in wide area networks

“…Centralized [2, 6,8,9,11,14,15,20,21] and distributed [5,10,12,13,16,19] heuristic algorithms for the real time multicast routing problem or Constrained Steiner Tree problem have bee proposed. In the centralized scheme, every node in the network has a full knowledge of the entire network topology and its status.…”

Steiner Tree Based Distributed Multicast Routing in Networks

“…Rugelj and Klavzar [26] base their solution on the so-called 'waving' technique. The main problem to be solved in order to implement P-SPH heuristic in network environments is the selection of the closest destination node to the partially built tree, because the least cost path information is distributed among network nodes.…”

A distributed dual ascent algorithm for Steiner problems in multicast routing

“…At each step a least cost path is added, from the existing partially built tree to a terminal not yet connected. Bauer and Varma [1] and Regelj and Klavzar [15] proposed distributed versions with a time complexity of O(|T | · |V |) (measured by the maximum sequence of messages) and O(|V | 2 ) exchanged messages. Novak et al [10] proposed improvements on those algorithms leading to a better practical performance, but could not change those worst case complexities.…”