Efficient routing and scheduling algorithms for optical networks

This paper studies the problems of dedicating routes and scheduling transmissions in optical networks. In optical networks, the vast bandwidth available in an optical ber is utilized by partitioning it into several channels, each at a dierent optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper classies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models. some scheduling problems in one specific model.