ISSN:
1572-8188
Keywords:
WDM networks
;
network dimensioning
Source:
Springer Online Journal Archives 1860-2000
Topics:
Electrical Engineering, Measurement and Control Technology
Notes:
Abstract The problem of network dimensioning, which involves 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 details in this paper. 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 that for 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 one on heuristics.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1010044623593
Permalink