Dynamic wavelength routing using congestion and neighborhood information

We present two dynamic routing algorithms based on path and neighborhood link congestion in all-optical networks. In such networks, a connection request encounters higher blocking probability than in circuit-switched networks because of the wavelength-continuity constraint. Much research has focused on the shortest-path routing and alternate shortest-path routing. We consider fixed-paths least-congestion (FPLC) routing in which the shortest path may not be preferred to use. We then extend the algorithm to develop a new routing method: dynamic routing using neighborhood information. It is shown by using both analysis and simulation methods that FPLC routing with the first-fit wavelength-assignment method performs much better than the alternate routing method in mesh-torus networks (regular topology) and in the NSFnet T1 backbone network (irregular topology). Routing using neighborhood information also achieves good performance when compared to alternate shortest-path routing.

[1]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .

[2]  Tak-Shing Peter Yum,et al.  Analysis of least congested path routing in WDM lightwave networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[3]  野村 祐士 International Conference on Communications (ICC'99) , 1999 .

[4]  Richard A. Barry,et al.  An Improved Model of Blocking Probability in All-Optical Networks , 1995, IEEE/LEOS 1995 Digest of the LEOS Summer Topical Meetings. Flat Panel Display Technology.

[5]  Suresh Subramaniam,et al.  Wavelength assignment in fixed routing WDM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[6]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[7]  Suresh Subramaniam,et al.  All-optical networks with sparse wavelength conversion , 1996, TNET.

[8]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[9]  Adrian Segall,et al.  Distributed network control for wavelength routed optical networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[11]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[12]  Anthony S. Acampora,et al.  Benefits of Wavelength Translation in All-Optical Clear-Channel Networks , 1996, IEEE J. Sel. Areas Commun..

[13]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[15]  Vincent W. S. Chan,et al.  All-Optical Network Consortium - Ultrafast TDM Networks (Invited Paper) , 1996, IEEE J. Sel. Areas Commun..

[16]  David K. Hunter,et al.  Performance of dynamic path optical networks , 1997 .

[17]  Masayuki Murata,et al.  Performance of alternate routing methods in all-optical switching networks , 1997, Proceedings of INFOCOM '97.

[18]  Anthony AcamporaAbstract On the Beneets of Wavelength Translation in All-optical Clear-channel Networks , 1996 .

[19]  Arun K. Somani,et al.  Dynamic wavelength routing in multifiber wdm networks , 2000 .

[20]  Pierre A. Humblet,et al.  Models of Blocking Probability in All-Optical Networks with and Without Wavelength Changers , 1995, IEEE J. Sel. Areas Commun..