Reconfiguration Heuristics for Logical Topologies in Wide-Area WDM Networks

Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to keep the network availability as much as possible during the reconfiguration process. For this purpose, a lightpath is taken as the minimum unit of reconfiguration, which is an all-optical wavelengthdivision multiplexed (WDM) channel. The proposed algorithms are evaluated by using an NFSNET-like network model with 16 nodes and 25 links. The results show that very simple algorithms provide very small computational complexity but poor performance, i.e., bad network availability, and that an efficient algorithm provides reasonable computational complexity and very good performance. More complex algorithms may improve performance somewhat further but have unrealistically large computational complexity.

• Type: Journal
• Year: 2006
• Where: IEICET
• Authors: Hironao Takagi, Yongbing Zhang, Hideaki Takagi
• Keywords: Algorithms, Computational Complexity, IEICET 2006, Network Availability