Construction of light-trees for WDM multicasting under splitting capability constraints

Communication systems with all-optical multicasting have better performance than those using optical/electrical/optical conversion. Multicast protocols assume that all nodes in the network can forward the signal from one input to several outputs. Since fabrication of an optical switch with splitting capability is an expensive technology, there are few switches that are multicast capable. The heuristics designed for all-optical networks have to handle this limitation. We introduce a shortest path based forest algorithm for all-optical networks. We propose a post-processing algorithm to reduce the number of wavelengths needed. The effect of this post-processing algorithm is also examined in a well-known approach.

[1]  Chunming Qiao,et al.  Benefits of multicasting in all-optical networks , 1998, Other Conferences.

[2]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[3]  B. Mukherjee,et al.  Architectures and algorithm for multicasting in WDM optical mesh networks using opaque and transparent optical cross-connects , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

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

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

[6]  K. Fukuchi,et al.  10.92-Tb/s (273/spl times/40-Gb/s) triple-band/ultra-dense WDM optical-repeatered transmission experiment , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[7]  Stefan Voss,et al.  Steiner-Probleme in Graphen , 1990 .

[8]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[9]  Stefan Voß,et al.  Problems with generalized steiner problems , 1992, Algorithmica.

[10]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

[12]  C. Siva Ram Murthy,et al.  WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .