千赢国际手机版文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A TABU SEARCH APPROACH TOWARDS CONGESTION AND TOTAL FLOW MINIMIZATION IN OPTICAL NETWORKS
1
作者 ValterBOLJUNCIC DarkoSKORIN-KAPOV JadrankaSKORIN-KAPOV 《系统科学与系统工程学报(英文版)》 CSCD 2004年第2期180-201,共22页
This paper considers rearrangeable multihop lightwave networks whereby each network node is equipped with a number p of transmitters and receivers, and a spectrum of wavelengths is accessible by, and shared among, all... This paper considers rearrangeable multihop lightwave networks whereby each network node is equipped with a number p of transmitters and receivers, and a spectrum of wavelengths is accessible by, and shared among, all nodes by using the Wavelength Division Multiplexing (WDM). Depending on input traffic flow, nodal transmitters and receivers can be re-tuned to create virtual connectivity best suited with respect to a given optimization criterion. We present an efficient heuristic algorithm that combines two criteria for optimization: throughput maximization, as well as total flow minimization. Throughput maximization criterion is equivalent to congestion minimization, while minimizing total flow under the assumption of having links with equal lengths implies minimization of the average number of hops. Taking into account lengths of the links (i.e. link costs proportional with distances), the total flow minimization becomes equivalent to the total delay minimization. Tabu search is implemented as a two-phase strategy dealing with diversification as well as intensification of search. Computational experiments include consecutive runs with different sets of weights associated with the two criteria. Results for a benchmark set of problems are presented. 展开更多
关键词 波长分度多路复用技术 重排光网络 最小全流 拥塞 启发式可解性 禁忌搜索 多次反射 最大吞吐量
上一页 1 下一页 到第
使用帮助 返回顶部 意见反馈