نتایج جستجو برای: routing and wavelength assignment
تعداد نتایج: 16847436 فیلتر نتایج به سال:
The Routing and Wavelength Assignment Problem deals with the routing of telecommunication traffic in all-optical networks. Extending existing algorithms, we present a memetic algorithm (MA) for the static RWA by introducing a recombination operator and a scheme for distributing the computation. Compared to previously achieved results for this problem, our MA significantly improves the solution ...
In this paper we consider the routing and wavelength assignment problem as well as the placement of wavelength converters in a wavelength routed all-optical network. Using a clustering technique called BI (Blocking Island), we propose a simple and intelligent RWA (Routing and Wavelength Assignment) algorithm: BI_RWA and a converter placement algorithm. These algorithms can be used in arbitraril...
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring problem (RPC). Here we present a polynomial time algorithm that solves RPC exactly in generalized tree networks of bounded degree. This new topology is of practical interest since it models tree-like backbone networks conn...
This paper gives an overview of the work carried out during the course of the COST-266 action on circuit/wavelength switched network studies. Several subjects are discussed in detail in this paper. A first important topic deals with the different control plane models in singleand multi-domain networks. A second important issue is the routing and wavelength assignment problem, both in networks w...
In this paper a generalized (static) routing and wavelength assignment problem is formulated, where the objective is to establish a given set of connections into the network while minimizing the number of wavelength channels at the same time. Connections can be normal lightpaths as well as anycast or multicast connections. Furthermore, each request can be for either a bidirectional or a unidire...
In this paper, we tackle the routing and wavelength assignment problem for wavelength division multiplexing (WDM) networks containing permanent and reliable wavelength paths (WPs). It consists of 4nding the route and the wavelength of each WP for the normal state of the network and for the important failure scenarios. These scenarios might be the most probable failure scenarios or simply the fa...
Through the use of configurable wavelength-division-multiplexing (WDM) technology including tunable optical transceivers and frequency selective switches, next-generation WDM networks will allow multiple virtual topologies to be dynamically established on a given physical topology. For node port networks, we determine the number of wavelengths required to support all possible virtual topologies...
In this paper routing and wavelength assignment for supporting multicast traffic is investigated in WDM mesh networks under sparse splitting constrain. This problem is generally solved in two phases respectively with the purpose of minimizing the number of wavelengths required. Alternative routing is first proposed to route each session by pre-computing a set of candidate light-forests. Then wa...
We propose an efficient heuristic algorithm that sets up and releases lightpaths for connection requests dynamically. We partition the routing and wavelength assignment (commonly known as RWA) problem into two subproblems and solves both of them using a well-known shortest path routing algorithm. For solving the routing subproblem, an auxiliary graph is created whereby the nodes and links in th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید