A multicast dynamic wavelength assignment algorithm based on matching degree

Abstract

The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied. A new multicast dynamic wavelength assignment algorithm is presented based on matching degree. First, the wavelength matching degree between available wavelengths and multicast routing trees is introduced into the algorithm. Then, the wavelength assignment is translated into the maximum weight matching in bipartite graph, and this matching problem is solved by using an extended Kuhn-Munkres algorithm. The simulation results prove that the overall optimal wavelength assignment scheme is obtained in polynomial time. At the same time, the proposed algorithm can reduce the connecting blocking probability and improve the system resource utilization.

Keywords

Bipartite Graph / Multicast Tree / Wavelength Conversion / Wavelength Assignment / Wavelength Converter

References

[1] LiaoL.-h., WenH.-b., WangS.. Journal of Optoelectronics·Laser, 2007, 18: 200

[2] XiaoC.-x., GuoY., DaiJ.-f.. Journal of Optoelectronics·Laser, 2005, 16: 1062

[3] LiJ.-y.. Journal of Optoelectronics·Laser, 2008, 19: 204

[4] RouskasG. N.. IEEE network, 2003, 17: 60

[5] ZhouY. Z., PooG. S.. Optical Switching and Networking, 2005, 2: 176

[6] SahinG., AzizogluM.. Proc. SPIE All-Optical Networking, November, 1998, 3531: 196

[7] JiaX. H., DuD. Z., HuX. D.. Proc. IEEE Transactions on Communications, 2001, 49: 341

[8] ZangH., JueJ. P., MukherjeeB.. Optical Networks Magazine, 2000, 1: 47

[9] SunY., GuJ., TsangD. H. K.. Optical Networks Magazine, 2001, 2: 101

[10] WangJ., ChenB.. IEEE Journal Selected Areas in Communications, 2003, 21: 1274

[11] Y. W. Chen and I. H. Peng, Photonic Network Communications, (2008), 141.

[12] HwangI. S., LeeS. N., ChuangY. F.. Photonic Network Communications, 2006, 12: 161

[13] L. Lovasz, and M. Plummer, Amsterdam: North- Holland, 1986.

[14] Network Simulator 2, http://www.isi.edu