A multicast dynamic wavelength assignment algorithm based on matching degree

作者：Wu Qi wu^*; Zhou Xian wei; Wang Jian ping; Yin Zhi zhong; Zhang Long

来源：Optoelectronics Letters, 2009, 5(4): 276-280.

DOI：10.1007/s11801-009-8207-2

• Bipartite graphs
• Dynamic wavelength assignment algorithm
• Matching degree
• Matching problems
• Multicast request
• Multicast routing
• Multicasts
• Optimal wavelength
• Polynomial-time
• Simulation result
• System resource utilization
• Wavelength assignment
• WDM networks

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. ? Tianjin University of Technology and Springer-Verlag 2009.

• 出版日期2009
• 单位北京科技大学