This paper surveys the theoretical results obtained for wavelength {routing all {optical
networks, presents some new results and proposes several open problems. In all {optical …

In OFDM-based optical networks, multiple subcarriers can be allocated to accommodate
various size of traffic demands. By using the multi-carrier modulation technique, subcarriers …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Considers routing connections in a reconfigurable optical network using WDM. Each
connection between a pair of nodes in the network is assigned a path through the network …

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian
and Hessian matrices using either finite differences or automatic differentiation. Several …

We explore design principles for next-generation optical wide-area networks, employing
wavelength-division multiplexing (WDM) and targeted to nationwide coverage. This optical …

We introduce a traffic model for circuit switched all-optical networks (AONs) which we then
use to calculate the blocking probability along a path for networks with and without …

The construction of disjoint paths in a network is a basic issue in combinatorial optimization:
given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths …

Graph coloring is one of the oldest and best-known problems of graph theory. Statistics
show that graph coloring is one of the central issues in the collection of several hundred …

The explosion of data traffic and the availability of enormous bandwidth via dense
wavelength division multiplexing (DWDM) and optical amplifier (OA) technologies make it …