在稀疏光分裂節點的光波分割多工網路上群播網路疏導的權重集合覆蓋演算法

A Weighted-Set-Cover Heuristic for Multicast Traffic Grooming in Sparse Splitting WDM Networks

林哲生(Che-Sheng Lin)

指導教授 ： 林華君

國立清華大學/電機資訊學院/資訊工程學系/碩士(2009年)

摘要

本篇論文主要在探討的是在sparse splitting網路環境下，動態的traffic在wavlength division multiplexing（WDM）mesh network會碰到的wavelength routing以及multicast traffic grooming問題。我們使用輔助圖來做輔助，並提出了sparse splitting traffic routing and grooming的演算法去解決此問題，以降低網路中connection的blocking probability。

關鍵字

光纖網路

參考文獻

[1] S. Paul, Multicasting on the Internet and Its applications. Boston, MA: Kluwer, 1998.

[2] B. Mukherjee, Optical Communication Networks. New York: McGraw-Hill, 1997.

[3] I. 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.

[4] 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.

[6] W. Yao and B. Ramamurthy, “A Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 8, August 2005.