对波分复用(Wavelength Divisi on Multiplexing,WDM)网状网中的动态域间流量疏导问题进行了深入研究.在源路由模式下,提出了一种基于固定备选路由方式的动态域间流量疏导算法,并在其基础上提出了只考虑波长均衡和同时考虑波长均衡与业...对波分复用(Wavelength Divisi on Multiplexing,WDM)网状网中的动态域间流量疏导问题进行了深入研究.在源路由模式下,提出了一种基于固定备选路由方式的动态域间流量疏导算法,并在其基础上提出了只考虑波长均衡和同时考虑波长均衡与业务均衡的改进方法.该算法可以有效地避免路由环,得到较低的阻塞率,节省全网的收发器数目和波长资源.仿真结果表明,这种算法可以有效地改善网络性能.展开更多
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 mat...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.展开更多
文摘对波分复用(Wavelength Divisi on Multiplexing,WDM)网状网中的动态域间流量疏导问题进行了深入研究.在源路由模式下,提出了一种基于固定备选路由方式的动态域间流量疏导算法,并在其基础上提出了只考虑波长均衡和同时考虑波长均衡与业务均衡的改进方法.该算法可以有效地避免路由环,得到较低的阻塞率,节省全网的收发器数目和波长资源.仿真结果表明,这种算法可以有效地改善网络性能.
基金supported by the National Natural Science Foundation of China (No.60872047 and 60773074)the National High Technology Research and Development Program of China (No.2009AA01Z217 and 2009AA01Z209)the Beijing Municipal Natural Science Foundation of China (No.4082020)
文摘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.
