Optimal Construction of Redundant Multicast Trees in Directed Graphs

Free registration required

Executive Summary

In this paper, the authors consider the problem of protection of multicast connections against single link or node failures using Redundant Multicast Trees (RMTs). RMTs connect the source node of a multicast connection to all its destinations in such a way that in the event of a single link or node failure in the network, every destination node is still connected to the source node in at least one of the two trees. Construction of RMTs has been studied extensively for undirected graphs, but not for directed graphs.

  • Format: PDF
  • Size: 150.5 KB