A multicast dynamic wavelength assignment algorithm based on matching degree
光电子快报:英文版(2009)
摘要
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.
更多查看译文
关键词
Bipartite Graph,Multicast Tree,Wavelength Conversion,Wavelength Assignment,Wavelength Converter
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络