In this paper we propose an adaptive routing strategy, called Weighted Link Capacity (WLC), as a candidate solution for the routing problem. The WLC algorithm consists on choosing the path that minimizes the cost of network resources, whilst, in parallel, maintaining the network traffic as balanced as possible. Its strategy is based on the number of hops, link length and free link capacity. We assume two constraints to block a connection: first, when there is no free path available; second, when the distance of the path exceeds the optical transmission reach of optical equipments without 3R regeneration, which results in a bit error rate above an acceptable limit (e.g., 10-12). The simulation results of dynamic traffic in two hypothetical m...
In the study of dynamic routing and wavelength assignment (DRWA) algorithms and protocols in optical...
To meet the increasing user bandwidth demands, the ICT networks are constantly expanding. The optica...
This paper presents the results of the algorithm Snake-Two, evolving from algorithm Snake-One, which...
[[abstract]]©2002 Springer Verlag-As the trend of increased reconfigurability emerges in wavelength ...
We propose a linear formulation for traffic routing in optical networks after the Virtual Topology D...
This paper proposes a new fixed-alternate routing algorithm for all-optical WDM networks without wav...
[[abstract]]In this paper, we investigate adaptive routing in wavelength-routed networks. Exploiting...
We focus on the routing and wavelength assignment (RWA) problem in intelligent and transparent optic...
[[abstract]]This paper concerns itself with the performance of adaptive routing in wavelength-routed...
[[abstract]]©2001 IEEE-As the trend of increased reconfigurability emerges in wavelength division mu...
The minimization of blocking probability is an important problem for the design of next generation h...
Abstract:- In order to use WDM networks efficiently and effectively, a lightpath is dynamically esta...
This work proposes a novel routing algorithm for transparent optical networks, which is based on the...
[[abstract]]The vast bandwidth in fibers can be efficiently tapped by advanced WDM technology, by wh...
Current developments in optical components ’ technologies enable wavelengths to be very narrowly spa...
In the study of dynamic routing and wavelength assignment (DRWA) algorithms and protocols in optical...
To meet the increasing user bandwidth demands, the ICT networks are constantly expanding. The optica...
This paper presents the results of the algorithm Snake-Two, evolving from algorithm Snake-One, which...
[[abstract]]©2002 Springer Verlag-As the trend of increased reconfigurability emerges in wavelength ...
We propose a linear formulation for traffic routing in optical networks after the Virtual Topology D...
This paper proposes a new fixed-alternate routing algorithm for all-optical WDM networks without wav...
[[abstract]]In this paper, we investigate adaptive routing in wavelength-routed networks. Exploiting...
We focus on the routing and wavelength assignment (RWA) problem in intelligent and transparent optic...
[[abstract]]This paper concerns itself with the performance of adaptive routing in wavelength-routed...
[[abstract]]©2001 IEEE-As the trend of increased reconfigurability emerges in wavelength division mu...
The minimization of blocking probability is an important problem for the design of next generation h...
Abstract:- In order to use WDM networks efficiently and effectively, a lightpath is dynamically esta...
This work proposes a novel routing algorithm for transparent optical networks, which is based on the...
[[abstract]]The vast bandwidth in fibers can be efficiently tapped by advanced WDM technology, by wh...
Current developments in optical components ’ technologies enable wavelengths to be very narrowly spa...
In the study of dynamic routing and wavelength assignment (DRWA) algorithms and protocols in optical...
To meet the increasing user bandwidth demands, the ICT networks are constantly expanding. The optica...
This paper presents the results of the algorithm Snake-Two, evolving from algorithm Snake-One, which...