According to previous studies, limited range wavelength conversion (LWC) can improve the performance of optical network. In this paper, the effects of FWM (Four Wave Mixing) and XGM (Cross-Gain Modulation) conversion ...According to previous studies, limited range wavelength conversion (LWC) can improve the performance of optical network. In this paper, the effects of FWM (Four Wave Mixing) and XGM (Cross-Gain Modulation) conversion are both examined. It is found that the performance difference between LWC and full conversion becomes quite remarkable with the increase in numbers of wavelengths per-link. So in order to improve the performance of optical network with limited conversion in the case of large number of wavelengths, three simple dynamic wavelength assignment algorithms (LUWC, FUWC and WSM) are proposed. Simulation results show that the algorithms greatly reduce the blocking probabilities of networks with LWC. Moreover, the algorithms require no global information of network.展开更多
In this paper, a Wavelength Division Multiplexing (WDM) network model based on the equivalent networks is described, and wavelength-dependent equivalent arc, equivalent networks, equivalent multicast tree and some oth...In this paper, a Wavelength Division Multiplexing (WDM) network model based on the equivalent networks is described, and wavelength-dependent equivalent arc, equivalent networks, equivalent multicast tree and some other terms are presented. Based on this model and relevant Routing and Wavelength Assign- ment (RWA) strategy, a unicast RWA algorithm and a multicast RWA algorithm are presented. The wave- length-dependent equivalent arc expresses the schedule of local RWA and the equivalent network expresses the whole topology of WDM optical networks, so the two algorithms are of the flexibility in RWA and the optimi- zation of the whole problem. The theoretic analysis and simulation results show the two algorithms are of the stronger capability and the lower complexity than the other existing algorithms for RWA problem, and the complexity of the two algorithms are only related to the scale of the equivalent networks. Finally, we prove the two algorithms’ feasibility and the one-by-one corresponding relation between the equivalent multicast tree and original multicast tree, and point out the superiorities and drawbacks of the two algorithms respectively.展开更多
文摘According to previous studies, limited range wavelength conversion (LWC) can improve the performance of optical network. In this paper, the effects of FWM (Four Wave Mixing) and XGM (Cross-Gain Modulation) conversion are both examined. It is found that the performance difference between LWC and full conversion becomes quite remarkable with the increase in numbers of wavelengths per-link. So in order to improve the performance of optical network with limited conversion in the case of large number of wavelengths, three simple dynamic wavelength assignment algorithms (LUWC, FUWC and WSM) are proposed. Simulation results show that the algorithms greatly reduce the blocking probabilities of networks with LWC. Moreover, the algorithms require no global information of network.
基金Supported by the Natrual Science Foundation of Shaanxi (No.2004A02) and Outstanding Scholar Project of P. R. China (2002).
文摘In this paper, a Wavelength Division Multiplexing (WDM) network model based on the equivalent networks is described, and wavelength-dependent equivalent arc, equivalent networks, equivalent multicast tree and some other terms are presented. Based on this model and relevant Routing and Wavelength Assign- ment (RWA) strategy, a unicast RWA algorithm and a multicast RWA algorithm are presented. The wave- length-dependent equivalent arc expresses the schedule of local RWA and the equivalent network expresses the whole topology of WDM optical networks, so the two algorithms are of the flexibility in RWA and the optimi- zation of the whole problem. The theoretic analysis and simulation results show the two algorithms are of the stronger capability and the lower complexity than the other existing algorithms for RWA problem, and the complexity of the two algorithms are only related to the scale of the equivalent networks. Finally, we prove the two algorithms’ feasibility and the one-by-one corresponding relation between the equivalent multicast tree and original multicast tree, and point out the superiorities and drawbacks of the two algorithms respectively.
