In this paper, we address the issue of traffic grooming in arbitrary WDM mesh networks. We present a novel groomer architecture wherein a combination of grooming at two different granularities is utilized to make the setup cost-effective without compromising on efficiency. We put forward an efficient algorithm for dynamic routing and wavelength assignment of sub-wavelength connections. We also ...

have largely been investigated separately, in particular, the RWA has seldom considered the existence of wavelength converters. In this paper, we argue perhaps for the first time, that an effective RWA algorithm needs to take into account the presence of wavelength conversion as the later is usually done at much earlier stage during the capacity planning. We proceed to show that existing dynami...

analysis requires the separate enumeration of the occupancy for every wavelength on every link used by multiple alternate routes for a single source-destination pair. In a network with F wavelengths per link, and with m links used by multiple alternate routes for a given source-destination pair, the calculation time required is exponential with the product of the number of wavelengths and numbe...

For a wavelength-routed network in which connection requests are arriving and departing at high rates, an appropriate control scheme must be implemented to set up lightpaths for each request in a fast and efficient manner. The control scheme, which includes routing and wavelength assignment algorithms, must also be scalable, and should attempt to minimize the number of blocked connections. In t...

In this paper we present a hybrid model for the static design variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing aspect, combined with a graph coloring step modelled using either MIP (Coin-OR), SAT (minisat) or finite domain constraints (ECLiPS...

This study deals with the formulation of an effective and efficient algorithm for load balancing in WDM networks. Here we develop a Load Balancing algorithm for IPlike Routing. The considered networks are based on a routing protocol where the next hop at a given node depends only on the destination of the communication. The aim of this work is to consider the applicability of this approach in t...

Appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks [3]. Given a static channel demand, the problem of routing and wavelength assignment (RWA) in such networks has to be solved. Due to the restricted number of wavelengths available on each link it is desirable to get a solution of ...

Fiber optic communication technology has brought a revolution since 1970s. This technology has rapidly replaced the copper wires, starting from the core backbone networks then gradually to the metro and now finally towards the access networks. WDM networks present concurrency by multiplexing more than one wavelength and transmit them simultaneously within the same fiber. A lightpath is an optic...

In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing and optimization aspect, combined with a finite domain constraint model for the wavelength assignment. If a solution to the con...

Recently, the number of carriers have increased and they intensively compete with each other. In order to accommodate skyrocketing traac, it is natural that several carriers newly construct ber optic networks as well as the existing ones. The wavelength division multiplexing (WDM) technology is promising for the construction. In the WDM networks, several routing and wavelength assignment strate...