In order to establish lightpaths in dynamic wavelength division multiplexed translucent optical networks, we propose an adaptive routing algorithm, which selects K edge-disjoint paths based on the network state, then chooses one route from the K alternatives considering not only the number of free wavelengths, the length of the route, but also the free transceivers in the nodes. An auxiliary graph is used to assign the wavelengths and locate the nodes for wavelength conversion or regeneration, after a route has been selected. Through extensive simulation using some commonly used network models, we show that the proposed routing and wavelength assignment algorithm can achieve better blocking performance than other algorithms.
Algorithms for Wavelength Division Multiplexed Translucent Optical Networks
Yabin Ye;
2004-01-01
Abstract
In order to establish lightpaths in dynamic wavelength division multiplexed translucent optical networks, we propose an adaptive routing algorithm, which selects K edge-disjoint paths based on the network state, then chooses one route from the K alternatives considering not only the number of free wavelengths, the length of the route, but also the free transceivers in the nodes. An auxiliary graph is used to assign the wavelengths and locate the nodes for wavelength conversion or regeneration, after a route has been selected. Through extensive simulation using some commonly used network models, we show that the proposed routing and wavelength assignment algorithm can achieve better blocking performance than other algorithms.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
