Adaptive lightpath routing in wavelength-routed networks

In this paper, we study the issue of dynamically selecting shortest paths in wavelength-routed networks. We present several fast shortest path selection algorithms for networks with and without wavelength conversions. The presented algorithms employ the strategies of sequential search, backward routing, and informed search. Simulation results demonstrate that our presented algorithms can significantly reduce the average-case running time in identifying shortest paths in wavelength-routed networks.

[1]  Guoliang Xue.  Optimal lightpath routing and rerouting in WDM networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[2]  Subrata Banerjee,et al.  A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..

[4]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[5]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[6]  Gang Liu,et al.  A*Prune: an algorithm for finding K shortest paths subject to multiple constraints , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Weifa Liang,et al.  Improved lightpath (wavelength) routing in large WDM networks , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[8]  Ahmed Mokhtar,et al.  Adaptive wavelength routing in all-optical networks , 1998, TNET.