Algorithm design in optical networking: algorithms, concepts, methodologies and ILP models

Abstract

This book focuses on algorithmic aspect of optical networking. Efficient algorithms are designed for multiple research topics in this area, including optical switch scheduling, virtual topology design, wavelength and light-trail routing, fast link failure detection/localization and p-cycle design. In optical switch scheduling, optical switch fabrics with reconfiguration overheads are considered. The objective is to achieve 100% throughput and minimize the required speedup and packet delay bound. Virtual topology design and light-trail routing are dedicated to some emerging optical technologies including Optical Burst Switching (OBS) and Light- Trail. Finally, we study some new concepts, design methodologies and ILP (Integer Linear Program) models in optical network survivability. In particular, simple and non-simple monitoring cycles (m-cycles) are introduced for fast link failure localization in mesh WDM (Wavelength Division Multiplexing) networks. In addition, new p-cycle design approaches without candidate cycle enumeration are invented, which are scalable to p- cycle design in large-size networks.