Network dimensioning in WDM-based all-optical networks

The problem of network dimensioning, which involves the optimal network designs using minimal resources for a given well-predicted traffic between individual nodes but without a pre-determined network topology, is analyzed in detail. Such optimal designs are critical, as the network resources are directly related to the cost of implementation. The problem complexity increases as the traffic between every node pair varies in a periodic manner. Furthermore, the presence of wavelength conflicts makes the network dimensioning problem distinct and more complicated than the traditional circuit-switching networks. Here, we adopt the approach based on a multi-commodity flow problem. A general cost function covering the resources of all system components is formulated, and two solution approaches are presented; one based on integer programming and the other on heuristics