A multicast dynamic wavelength assignment algorithm based on matching degree

来源 :Optoelectronics Letters | 被引量 : 0次 | 上传用户:zhiyin1976
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
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. 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 wavelengths and multicast routing trees is introduced into the algorithm. the wavelength assignment is translated into 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 coupling blocking probability and improve the system resource utilization.
其他文献