Regenerator allocation consists on selecting which of the already installed regenerators in a translucent network may be used according to the dynamic traffic requests in order to maximize the quality of the optical signal while minimizing the opaqueness of the network. A recent study has shown that the performance of the regenerator allocation techniques strongly depends on the accuracy of the...

algorithm algorithm (Numerical results will be discussed in Section N). mnveraion We argue in this paper thnt any RWA algorithm h this paper, we propose a new dynamic RWA algorithm, needs to take into aeconnt the underlying wavelength conversion called weighred least-congesnon routing and firsv'it for two IFBJons: 1) wavelength converter placement is usually wavelength assignrnenl (WLCR-FF), wh...

1389-1286/$ see front matter 2008 Elsevier B.V doi:10.1016/j.comnet.2008.11.014 * Corresponding author. Address: Athens Informat Markopoulo Ave., 19002 Peania, Athens, Greece. Te E-mail addresses: [email protected], siamak@ac. molky), [email protected] (M. Klinkowski), Marin), [email protected] (D. Careglio), pareta@ac [email protected] (I. Tomkos). Optical networks are moving from opaque and t...

Advances in optical WDM technology have paved the way for high-capacity wavelength channels capable of carrying information at Gb/s rates. However, with current traffic streams requiring only a fraction of a wavelength’s bandwidth, it becomes necessary to groom these independent low rate traffic streams on to higher capacity wavelength channels. An alloptical approach to grooming is to allow ma...

We develop an on-line routing and wavelength assignment (RWA) algorithm for a WDM bidirectional ring with N nodes. The algorithm dynamically supports all k-allowable traÆc matrices, where k denotes an arbitrary integer vector (k1; :::; kN ), and node i, 1 i N , can transmit at most ki wavelengths and receive at most ki wavelengths. Our algorithm uses d PN i=1 ki=3e wavelengths in each ring dire...

The planning problem of novel DWDM-centric converged metro/aggregation networks is solved by algorithms based on intelligent wavelength assignment and an auxiliary-graph approach that exploits load-balanced routing and the optical-multiplexing capability of WSSes.

This paper studies the routing and wavelength assignment problem for a circuit-switched time division multiplexed (TDM) wavelength-routed (WR) optical WDM network. In a conventional wavelength routed network, an entire wavelength is assigned to a given session (or circuit). This can lead to lower channel utilization when the individual sessions do not need the entire channel bandwidth. This pap...

We propose a new lightpath routing algorithm for WDM optical networks that solves the routing and wavelength assignment (commonly known as RWA) problem dynamically and separately. The RWA problem is partitioned into two subproblems, the routing and wavelength assignment problems, and both of them are solved using the shortest path routing technique. For solving the routing subproblem, an auxili...

A novel approach for modeling the optimal routing and wavelength assignment problem in wavelength division multiplexed all–optical networks is proposed. It is assumed that the optical switching nodes are equipped with a limited and scalable set of wavelength converters which can be used by any subset of incoming optical–connections. The proposed model, called the interconnected–layered–graph, p...