在全光式WDM網路（all-optical WDM networks）中，使用光分裂功能之節點( splitter node )能讓資料由輸入埠接收光訊號並複製成多份傳送給不同的目的節點，也才能有效率的支援單點對多點資料傳輸( multicast )的功能。然而，由於splitter node成本昂貴，必須限制splitter node在網路中使用的數量，這樣只有少部分nodes為splitter nodes的網路環境，稱之為sparse splitting networks。如何在疏離光分裂節點的光波分割多工網路( sparse splitting WDM networks )上，設計群播資料的繞徑成為光纖網路上一個重要的研究課題。
本論文的目的是在Drop-or-Continue ( DoC )交換器架構下，研究稀疏光分裂節點的光纖網路（Sparse Splitting WDM Networks）中Dynamic Multicast Routing的問題。本論文會設計一套新的Dynamic Multicast Sparse Splitting Routing演算法達到降低connection request blocking probability的目的。我們在光纖網路部分會對所有destinations做一個全盤的規劃，進而決定路徑的配置，以減少個別destination考慮所造成的網路資源浪費。

[1] Chlamtac, A. Ganz, and G. Karmi, “Lightpath communications: An approach to high bandwidth optical WAN’s,” IEEE Transactions Communications, vol. 40, no. 7, pp. 1171–1182, Jul. 1992.
[2] Girard, Routing and Dimensioning Circuit-switched Networks, Addison Wesley, 1990.
[3] Siva Ram Murthy and M. Gurusamy, WDM Optical Networks: Concepts, Design, and Algorithms, Prentice-Hall, 2002.
[4] J. Zheng and H. T. Mouftah, Optical WDM Networks: Concepts and Design Priciples, A John Wiley & Sons, 2004.
[5] A. Birman, “Computing Approximate Blocking Probabilities for a Class of All-optical Networks,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 5, pp. 852-857, June 1996.
[6] L. H. Sahasrabuddhe and B. Mukherjee, “Light trees: Optical multicasting for improved performance in wavelength routed networks,” IEEE Communications Mag., vol. 37, no. 2, pp. 67–73, Feb. 1999.
[7] N. K. Singhal, L. H. Sahasrabuddhe, and B. Mukherjee, “Optimal Multicasting of Multiple Light-Trees of Different Bandwidth Granularities in a WDM Mesh Network With Sparse Splitting Capabilities,” IEEE/ACM Transactions on Networking, vol. 14, no. 5, Oct. 2006.
[8] G. Chowdhary and C. S. R. Murthy, “Grooming of multicast sessions in WDM mesh networks,” in Proceedings of the 1st Interbnational Workshop on Traffic Grooming, 2004.
[9] X. Zhang et al., “Constrained multicast routing in WDM network with sparse light splitting,” IEEE J. Lightwave Technol., vol. 18, no. 12, Dec. 2000.
[10] C. Siva Ram Murthy and M. Gurusamy, WDM Optical Networks: Concepts, Design, and Algorithms, Prentice-Hall, 2002.
[11] M. Charikar, C. Chekuri, T.Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed Steiner problems. In SODA, 1998.
[12] Hsieh, C.-Y., Liao, W., ”All-optical multicast routing in sparse splitting WDM networks.” IEEE J. Sel. Areas Commun. vol.25, no. 6, pp.51–62, 2007.
[13] Sreenath, N, Siva Ram Murthy, C., Mohan, G.”Virtual source based multicast routing in WDM optical networks.“ Photonic Network Communication, vol. 3, no. 3, 213–226, 2004.
[14] Fen Zhou, Mikl´os Moln´ar, Bernard Cousin.”Distance priority based multicast routing in WDM networks considering sparse light splitting.” The 11th IEEE International Conference on Communication System, pp709-714, Guangzhou, China, November, 2008.
[15] Fen Zhou, Miklos Molnar, Bernard Cousin, "Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?" Proceedings of 18th International Conference on Computer Communications and Networks, pp.1-7, 2009.
[16] A. Zelikovsky, "A series of approximation algorithms for the acyclic directed Steiner tree problem", Algorithmica, 18(1):99-110, 1997.
[17] M.-I. Hsieh, E.H.-K. Wu, and M.-F. Tsai, “Faster DSP : A faster approximation algorithm for directed Steiner tree problem, ” Journal Of Information Science and Engineering, vol.22, pp.1409–1425, 2006.
[18] F. Hwang and D. Richards, “Steiner tree problems,” Networks, vol. 22,pp. 55-89, 1992.
[19] Wen-Yu Tseng and Sy-Yen Kuo, “All-optical multicasting on wavelength-routed WDM networks with partial replication,” in Proc. IEEE ICC ’01, Helsinki, Finland, June 2001.
[20] H.C. Lin, S.W. Wang, Splitter placement in all-optical WDM networks, in: Proceedings of the Globecom, 2005, pp. 306–310.