Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks

Abstract

International audienceIn sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N −1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917–1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency ofwavelength usage

Multicast Traffic Grooming in Tap-and-Continue WDM Mesh Networks

“…This increases the cost of the node and is also difficult to implement. The network cost may be reduced with sparse light splitting [24][25][26][27][28], where only a subset of nodes are multicast capable while the others are multicast incapable. The works reported in [24][25][26][27][28] find the minimal cost light-forest (multiple light-trees) to accommodate a multicast connection request, with the additional condition that light signals cannot be split at multicast incapable nodes.…”

“…Equation (28) ensures that, apart from the source and destinations of the connection request, each end node or a tap-receiving node on that multicast session must be the starting node of some trails which support the connection request. Equation (29) ensures that the bandwidth used by all multicast connection requests in the trail (i, w, k) must be equal to or less than the total capacity offered by that trail.…”

Multicast traffic grooming in optical WDM networks

“…The network cost may be reduced with sparse light splitting [28,32,[138][139][140], where only a subset of nodes are multicast capable. The works reported in [28,32,[138][139][140] find the minimal cost light-forest (multiple light-trees) to accommodate a multicast connection request, with the additional constraint that light signals cannot be split at multicast incapable nodes. which an approximate heuristic was proposed in [141].…”