Performance of multiobjective computational intelligence algorithms for the routing and wavelength assignment problem
نویسندگان
چکیده
منابع مشابه
Heuristic Algorithms for the Generalized Routing and Wavelength Assignment Problem
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...
متن کاملReview of routing and wavelength assignment problem
In today’s internet world there is a growing demand of network bandwidth. Where traditional copper fibers offer very less bandwidth, optical fibers can offer very lager bandwidth. So, there is a growing sense of using optical fibers. Optical networks generally use wavelength division multiplexing (WDM) technique, which is the backbone of future generation internet. In WDM networks fibers are lo...
متن کاملSolving the Static Design Routing and Wavelength Assignment Problem
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...
متن کاملPractical routing and wavelength assignment algorithms for all optical networks with limited wavelength conversion
We present an Integer Linear Program based algorithm and a K shortest path based heuristic algorithm for solving the Routing and Wavelength Assignment problem in All Optical Networks with Limited Wavelength Conversion. These algortihms are executed on a random mesh National Science Foundation Network(NSFNET). Their performances are compared.
متن کاملApproximation Algorithms for Wavelength Assignment
Winkler and Zhang introduced the FIBER MINIMIZATION problem in [3]. They showed that the problem is NP-complete but left the question of approximation algorithms open. We give a simple 2-approximation algorithm for this problem. We also show how ideas from the Dynamic Storage Allocation algorithm of Buchsbaum et al [1] can be used to give an approximation ratio arbitrarily close to 1 provided t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingeniería e Investigación
سال: 2016
ISSN: 2248-8723,0120-5609
DOI: 10.15446/ing.investig.v36n1.50384