Ant-Based Alternate Routing in All-Optical WDM Networks

نویسندگان

  • Son-Hong Ngo
  • Xiaohong Jiang
  • Susumu Horiguchi
چکیده

We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-divisionmultiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants’ foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P. key words: ant-based routing, routing and wavelength assignment, WDM networks, alternate routing

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

ثبت نام

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

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Adaptive alternate routing in WDM networks and its performance tradeoffs in the presence of wavelength converters

Routing in wavelength-routed all-optical WDM networks has received much attention in the past decade for which fixed and dynamic routing methods have been proposed. Taking into account the observation that wavelength-routed all-optical WDM networks are similar to circuit-switched voice networks, except with regard to wavelength conversion, we propose an adaptive alternate routing (AAR) scheme f...

متن کامل

Dynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks

There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...

متن کامل

Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents

In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting a new routing table structure and keeping a number of ants in the network to cooperatively explore the network states and continuously update the routing tables, our new ant algorithm can efficiently support the ants...

متن کامل

Multi-Path Routing and Wavelength Assignment (RWA) Algorithm for WDM Based Optical Networks

In optical WDM networks, transmission of information along optical lines is advantageous since it has high transmission capacity, scalability, feasibility and also high reliability. But large amount of information is being carried; any problem during transmission can lead to severe damage to the data being carried. Hence it is essential to consider the routing as well as the wavelength assignme...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • IEICE Transactions

دوره 89-B  شماره 

صفحات  -

تاریخ انتشار 2006