limited number of wavelengths per fiber, where provisioning seeks to minimize the amount of required fiber 16, 71. . -This paper concerns connection provisioning for optical networks employing wavelength division multiplexing. A heuristic algorithm is developed and numerically studied for routing and wavelength assignment Of a set Of static connection solution of this problem. An adaptation of the algorithm is specified set of failures. The proposed algorithm is based on taking all failures into consideration simultaneously, and performs better than developing independent designs for each failure. In this paper we focus on heuristic methods for provisioning a stat,ic set, of connections on a. given WDM optical network topology. It is assumed that each connection requires a dedicated wavelength on each link of its path. We consider on each fiber, and therefore the connections are established Each fiber has a cost which reflects the fiber material, optical amplifiers, and the optical termination equipment at both ends of the link, The objective of provisioning is taken as the minimization of the total network cost. requests. The much faster than the Optimum the setting where there is a fixed set of wavelengths available proposed to design networks which can at the expense of possibly multiple fibers on network links.
The work in REF mainly concerns connection provisioning for optical networks.
Provisioning algorithms for WDM optical networks
TNET
Computer Science