A. El-Amawy and M. Sarhan (USA)
Blocking Probability, RWA problem, WDM Mesh, Wavelength Assignment.
It is well known that simple WDM topologies such as rings will not be able to meet the challenging demands of next generation WDM networks at the Metro and Local area levels. This has prompted increased interest in topologies with richer connectivities such as meshed networks. Such topologies will be able to allow for fast service restoration and fast provisioning, while offering a high degree of fault tolerance. In addition they will be able to support QoS and offer much higher bandwidths. This paper introduces and theoretically analyzes a set of novel wavelength assignment strategies for regular WDM meshes. The strategies are designed with the purpose of avoiding collisions taken into account a priori. The concept is to relate the routing algorithm and the wavelength assignment so as to avoid collisions as much as possible. We assume different numbers of wavelengths and proceed to estimate the blocking probabilities under different strategies assuming uniform distribution of destinations. Our results show that well designed off-line strategies outperform traditional off line (and on-line strategies for that matter). We provide reasoning for designing near-optimal solutions. The concepts underlying this work can be extended to irregular networks. Alternatively, a virtual regular mesh can be embedded in the irregular graph so as to utilize the power and performance obtainable with regular topologies.
Important Links:
Go Back
