Solving the RWA Problem in WDM Optical Networks Using the BCO Meta-Heuristic

نویسنده

  • Goran Z. Marković
چکیده

This paper researches the routing and wavelength assignment (RWA) problem in wavelength routed optical WDM networks with the wavelength conversion capability at different network nodes. We studied the static case in which all connection requests are known in advance, thus a routing decision can be made based on the complete knowledge of the traffic to be served by the network. The Bee Colony Optimization (BCO) metaheuristic is applied to solve the RWA problem. We carried out a comprehensive simulation study of the performance of the proposed BCORWA algorithm for different network topologies and traffic scenarios. The obtained simulation results are analyzed and compared.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Radio over Fiber networks synthesis using meta-heuristic BCO

Radio access network over fiber (RoF) technology combines both wireless and fiber-optic technology. The advantages of this technology are low attenuation, bigger network bandwidth, easy installation and management, reduced power consumption, multiservice, dynamic allocation of resources. There are many methods of designing optical and wireless networks. Since RoF combines these technologies, th...

متن کامل

Routing and wavelength assignment in all-optical networks based on the bee colony optimization

Routing and Wavelength Assignment (RWA) problem in all-optical networks assumes determining the routes and wavelengths to be used to create the lightpaths for connection requests. The RWA problem belongs to a class of difficult combinatorial optimization problems. We propose the Bee Colony Optimization (BCO) heuristic algorithm tailored for the RWA problem (BCO–RWA) in all-optical networks with...

متن کامل

Polynomial Time Algorithm (PTA) to generate a survivable ring virtual topology for Optical WDM based on the Hamiltonian Circuit Detection Heuristics(HCDH)

The Routing and Wavelength Assignment (RWA) problem is known to be NP-hard for general Physical Topology (PT) in optical networks. We have analyzed the survivability of the optical network under Survivable Routing and Shared Path Protection (SPP) for various topologies and suggested two survivable RWA algorithms which are shown to perform better under certain performance matrix by simulation. G...

متن کامل

A Genetic Algorithm Way of Solving RWA Problem in All Optical WDM Networks

This research work presents aGenetic Algorithm (GA) heuristic approach to solve the static Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexing (WDM) networks under wavelength continuity constraint. The RWA problem is modeled as an Integer Linear Programming (ILP) problem with the optimization objective to balance the network load among the connection requests. We...

متن کامل

Routing and wavelength assignment in WDM optical networks : exact resolution vs. random search based heuristics Résolution exacte et résolution approchée du problème de routage et affectation de longueurs d’onde dans les réseaux optiques WDM

The routing and wavelength assignment (RWA) problem has been widely studied for the past decades in the framework of wavelength division multiplexing (WDM) optical networks. Most of the papers deal with incremental traffic and propose algorithms that serve the traffic demands sequentially according to their arrival order. Actually, the order according to which the demands are dealt with has a m...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010