Avoidance of multicast incapable branching nodes for multicast routing in WDM networks

Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are not always taken into consideration. This paper proposes a novel wavelength routing algorithm, which tries to avoid the multicast incapable branching nodes (MIB, branching nodes without splitting capability) to diminish the link stress for the shortest path based multicast tree and maintains good parts of the shortest path tree to reduce the end-to-end delay. Firstly a DijkstraPro algorithm with priority assignment and node adoption is introduced to produce a shortest path tree with up to 38% fewer MIB nodes, and then critical articulation and deepest branch heuristics are used to process the MIB nodes. Finally distance based reconnection algorithm is proposed to create the multicast tree or forest.