%0 Journal Article
%T HEURISTIC ALGORITHM FOR MINIMIZING THE NUMBER OF WAVELENGTHS IN VWP OPTICAL NETWORKS<br>一种求解虚波长路径光网络波长资源优化问题的启发式算法
%A Zhang Jie
%A Gu Wanyi
%A Li Guorui
%A Xu Daxiong
%A <br>张杰
%A 顾畹仪
%J 光子学报
%D 1997
%I 
%X This paper proposes a path accommodation design algorithm applicable to virtual wavelength path networks that heuristically minimize the number of wavelengths required by the realization of optical paths. A new optimal routing strategy based on the maximum probability paths is introduced in the algorithm. At last, the numerical results of a sample network show the effect of the algorithm.
%K Wavelength division multiplexing
%K Virtual wavelength path
%K Heuristic algorithm<br>波分复用
%K 虚波长路径
%K 启发式算法
%K 光网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=47EA7CFDDEBB28E0&jid=9F6139E34DAA109F9C104697BF49FC39&aid=F2E7212AE0374C7A56951EB818EDFC97&yid=5370399DC954B911&vid=96C778EE049EE47D&iid=F3090AE9B60B7ED1&sid=BD77137A0285B6FF&eid=C45B504FED793340&journal_id=1004-4213&journal_name=光子学报&referenced_num=1&reference_num=0