A multicast dynamic wavelength assignment algorithm based on matching degree

被引：1
|
作者：
Wu Q.-W. [1 ]
Zhou X.-W. [1 ]
Wang J.-P. [1 ]
Yin Z.-Z. [1 ]
Zhang L. [1 ]
机构：
[1] School of Information Engineering, University of Science and Technology Beijing
来源：
Optoelectronics Letters | 2009年 / 5卷 / 4期
基金：
中国国家自然科学基金;
关键词：
Bipartite Graph; Multicast Tree; Wavelength Conversion; Wavelength Assignment; Wavelength Converter;
D O I：
10.1007/s11801-009-8207-2
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：276 / 280
页数：4
相关论文
共 50 条
12345