Performance assessment of multicast node placement for multicast routing in WDM networks with sparse light splitting

This article examines all-optical multicast routing for wavelength-routed optical networks with sparse Multicast Capable (MC) nodes in two phases. The first phase is MC node placement and use of a simple and straightforward Maximum Path Count First (MPCF) algorithm to obtain candidates for MC nodes. The second phase is multicast routing with MC-based schemes that minimizes the number of wavelength channels with minimum transmission delay as required by a given multicast session, in that a light-tree is first constructed to connect MC nodes in a multicast group by using two algorithms, namely, the Pre-computing Minimum Cost (PMC) tree algorithm and the Pre-computing Shortest Path (PSP) tree algorithm. System performance of the proposed MPCF MC node placement algorithm is compared with that of the Normalized Cuts (NC) MC node placement algorithm for both PMC and PSP multicast routing. Furthermore, simulation results compare PMC and PSP multicast routing based on MPCF and NC node placement with Re-route-to-Source (RTS), Re-route-to-Any (RTA), Member-First (MF), and Member-Only (MO) multicast routing based on a light forest for a given multicast session in terms of average number of wavelengths needed, average blocking probability, and mean maximum transmission delay.

[1]  J. Deogun,et al.  Cost-effective implementation of multicasting in wavelength-routed networks , 2000, Journal of Lightwave Technology.

[2]  W.S. Hu,et al.  Multicasting optical cross connects employing splitter-and-delivery switch , 1998, IEEE Photonics Technology Letters.

[3]  S.H. Srinivasan,et al.  Normalized cuts for wavelength converter placement , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[4]  Sy-Yen Kuo,et al.  All-optical multicasting on wavelength-routed WDM networks with partial replication , 2001, Proceedings 15th International Conference on Information Networking.

[5]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

[6]  Suresh Subramaniam,et al.  All-optical networks with sparse wavelength conversion , 1996, TNET.

[7]  I-Shyan Hwang,et al.  A novel dynamic fault restoration mechanism using cluster allocation approach in WDM mesh networks , 2006, Comput. Commun..

[8]  Biswanath Mukherjee,et al.  Light trees: optical multicasting for improved performance in wavelength routed networks , 1999, IEEE Commun. Mag..

[9]  Chunming Qiao,et al.  Constrained multicast routing in WDM networks with sparse light splitting , 2000 .

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Wanjiun Liao,et al.  All optical multicast routing in sparse-splitting optical networks , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[12]  I-Shyan Hwang,et al.  Multicast wavelength assignment with sparse wavelength converters to maximize the network capacity using ILP formulation in WDM mesh networks , 2006, Photonic Network Communications.

[13]  Masayuki Murata,et al.  Lightpath Management of Logical Topology with Incremental Traffic Changes for Reliable IP over WDM Networks , 2002 .

[14]  Jitender S. Deogun,et al.  Route optimization of multicast sessions in sparse light-splitting optical networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[15]  N. Sreenath,et al.  Virtual source based multicast routing in WDM networks with sparse light splitting , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).