An Efficient Heuristic Search for Optimal Wavelength Requirement in Static WDM Optical Networks
- 306 Downloads
This paper presents a heuristic search technique for finding an optimal requirement of wavelengths to satisfy a static lightpath demand in wavelength division multiplexed (WDM) optical networks. We have formulated the problem as a combinatorial optimization problem and used a state space search algorithm based on best first search strategy to solve it. We have compared the performance of our algorithm with another well-known technique with respect to the number of wavelength requirements and call blocking probability. Simulation runs for a wide range of lightpath demands over different WDM networks show that our proposed technique is better in both the above stated dimensions.
Unable to display preview. Download preview PDF.
- 1.Green, P.E.: Progress in Optical Networking. IEEE Communications Magazine, 54–61 (January 2001)Google Scholar
- 3.Dutta, R., Rouskas, G.N.: A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks. Optical Networks Magazine, 73–89 (January 2000)Google Scholar
- 4.Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength Routed Optical WDM Networks. Optical Networks Magazine, 47–60 (January 2000)Google Scholar
- 10.Jana, S., Chowdhury, S., Saha, D., Mukherjee, A., Chowdhury, P.: Assigning Wavelengths in WDM Optical Networks: A Novel Dynamic Approach. In: Proc. 6th Intaernational Conference HPC Asia, Bangalore, India (December 2002)Google Scholar