This study considers the routing and wavelength assignment problem (RWA) in optical wavelength-division multiplexed networks. The focus is dynamic traffic, in which the number of wavelengths per fiber is fixed. We attempt to minimize connection blocking using Ant Colony Optimization (ACO). The algorithm employed quantifies the importance of using length and congestion information in making rout...

With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution because of the huge size of the state space. Only heuristic algorithms have been presented up till now. In this paper we propose an approach where, starting from a given heuristic algorithm, one obtains a better algorithm ...

We consider the routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) networks without wavelength conversion. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. ...

Wavelength-routed all-optical networks have been receiving signiicant attention for high-capacity transport applications. A good routing and wavelength assignment (RWA) algorithm is critically important to improve the performance of wavelength-routed WDM networks. We study the blocking performance of xed-paths least-congestion (FPLC) routing in multiiber WDM networks in this paper. A new analyt...

We introduce the Power-Aware RWA problem, whose goal is to accommodate lightpaths in wavelength routing networks minimizing the power consumption. Formulation, algorithms, and results are presented, showing that significant power savings are possible. Introduction Wavelength Routing (WR) networks offer the flexibility of designing a “logical topology”, comprising lightpath requests, over a phys...

We propose a new routing and wavelength assignment scheme that improves the blocking probability of WDM networks and offers a very good utilizat ion of the networks resources. This heuristic results in high quality of service, prioritization of the LAN networks and lower installat ion costs compared with the traditional RWA algorithms applied in WDM networks. It is based on the distributed Dijk...

The multicast routing and wavelength assignment (MC-RWA) problem is generally studied with the objective to maximize the number of multicast groups admitted, or equivalently, to minimize the call (or session) blocking probability given a certain number of wavelengths. While this approach is sound, a better objective is to maximize the total number of users served (i.e., minimizing the user bloc...

In optical networks the vast bandwidth available in an optical bre may be utilized by splitting it into several channels each of a di erent wavelength This allows signals to be routed entirely in the optical domain This es say studies such routings and examines the number of di erent wavelengths needed for irregular networks We nd the number of wavelengths needed in large random networks in ter...

Abstracf— This paper considers the problem of routing connections in a reeontigurable optical network using wavelength division multiplexing. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned d]fferent wavelengths. We derive an upper bound ...

Physical impairments caused by noise and signal distortions affect the quality of an optical signal. The effect of physical impairments becomes more significant with an increase in distance and bit rates. In order to minimize the bit error rate (BER), an optical signal may need to be regenerated after a certain distance. This is mainly achieved through re-amplification, re-shaping, and retiming...