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

Zhou, Fen; Molnar, Miklos; Cousin, Bernard

doi:10.1007/s11107-009-0200-3

Cited by 15 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

Section: A Related Workmentioning

confidence: 99%

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

Lin

Zhong

Bose

et al. 2012

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Multicast applications are expected to be major drivers of Internet traffic growth. As most multicast connections require much lower bandwidth than the capacity offered by a wavelength, multicast traffic grooming is needed to efficiently use network resources. Recent research on multicast grooming has focused on light-trees because of their natural advantage for multicast traffic. However, using light-trees may lead to some serious negative side effects because of light splitting. In this paper, we investigate the multicast traffic grooming problem in tap-and-continue (TaC) networks, where a node can tap a small amount of incoming optical power for the local station while forwarding the remainder to an output. We first propose a simple and efficient node architecture with the TaC mechanism. We use this in an integer linear programming (ILP) formulation with the objective of minimizing the network cost in terms of the number of higher layer electronic ports and the number of wavelengths used. Since the ILP is not scalable, two heuristic algorithms, multicast trail grooming (MTG) and multiple destination trail-based grooming (MDTG), are proposed. Using the ILP, we show that having more costly nodes with multicast capability does not improve the performance significantly. The solutions obtained by MTG and MDTG are close to the ILP optimal solution. MTG and MDTG are shown to work efficiently for typical network topologies such as NSFNET, with MTG showing better performance than MDTG.

show abstract

Section: A Related Workmentioning

confidence: 99%

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

Lin

Zhong

Bose

et al. 2012

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…3a. However, by implementing the Hypo-Steiner Heuristic, MI (8,10) and (10,11) are deleted from graph G 1 to get G 2 . It is interesting to find that the shortest path SP G 2 (8−7−5−4−9) in the new graph G 2 is able to connect node 9 to the current subtree, which is the shortest constraintsatisfied path between them.…”

Section: Hypo-steiner Heuristicmentioning

confidence: 99%

“…Given a multicast group, the more destinations a light-tree is able to span, the fewer wavelengths will be needed. A lot of research has addressed the light-tree formation algorithms [8,7,[9][10][11][12]. In [9], a QoS routing algorithm is proposed to construct a light-tree with delay constraint and the cost approximation of light-tree is given.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

2010

Self Cite

View full text Add to dashboard Cite

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

show abstract

“…Relevant propositions for generating multicast trees on optical networks in which not all nodes have light splitters have been presented in [1] [7] [8] and [9]. Some of these proposals are based on additional signaling performed during or before data forwarding to generate trees, taking into consideration splitters location.…”

Section: Related Workmentioning

confidence: 99%

Efficient placement of light splitters in heterogeneous optical networks

Jawhar

Cousin

Lahoud

2010

7th International Symposium on High-Capacity Optical Networks and Enabling Technologies

View full text Add to dashboard Cite

When multicasting in optical networks is implemented within the switching control plane, it combines the efficiency of multicast trees along with the high speed and low delay of optical communications. Multicast nodes must be equipped with light splitters. Light splitters are expensive equipment. Therefore, a limited number of optical nodes will have this splitting capability. A good placement of optical splitters can increase the efficiency of the multicast signaling and routing techniques on the one hand, and reduce the number of splitters on the other hand. This leads to faster multicast trees setting up, lower data transmission delays, and less traffic on the network links; thus saving of optical links capacity for other multicast and unicast transmissions. In order to achieve efficient multicasting in optical network, we propose to take into account network characteristics i.e. link capacity and node degree when placing the optical splitters. The benefits of the smart placement of light splitters will be clearly shown in heterogeneous optical networks, where multicast traffic is not uniformly distributed over the network, and optical links connecting different nodes in the network have different characteristics.

show abstract

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

Cited by 15 publications

References 17 publications

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

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

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

Efficient placement of light splitters in heterogeneous optical networks

Contact Info

Product

Resources

About