• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2013-2026
• /
• 1998

In optical passive star interconnections, all packets are transmitted between nodes ina broadcast and-select manner. It is assumed that each node has a innable transmitter and a fixed-savelength receiver, ad that all packet lengths are equal so that each transmission can be done in a unit time. The tuning delay, denoted by $\delta$, means the amount of time for transmitter to change its wavelength to another one. The problec is , given ay value of the mumber of nodes N and the number of wavelengths $\kappa$ according to WDM implementations, to find transmission schedules with minimum cycle length for all-to all brondcaxt where no one sends any packet to itself. In this paper, we prove that the cycle length of optimal transcission schedules should be at least $max[[{\frac{N}{k}](N-1)}]$,$k\delta$$+N-1$. A novel algorithm for optimal transmission schedules is then presented when N-1 is divisible by $\kappa$. This algorithm also can be used for any values of N and $\kappa$ if the tuning delay $\delta$ does not affect strictly the cycle length of transmission schedules, i,e, $[\frac{N}{k}](N-1)$ > $\kappa\delta$+N-1.