Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks

نویسندگان

  • Xiaohua Jia
  • Hongwei Du
  • Xiao-Dong Hu
  • Deying Li
چکیده

In multihop WDM (Wavelength division multiplexing) systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the joint of two lightpaths if they use different wavelengths. Wavelength conversion incurs significant delay in data transmission, and overhead in connection setup. This paper discusses the problem of assigning wavelengths to a set of lightpaths such that the overall number of wavelength conversions in the system is minimized. The problem is formulated as the maximum clique-partition problem and an approximation algorithm is proposed to solve it. We also quantatively analyze the relationship between the number of wavelengths and the number of conversions required in the system. Extensive simulations have been conducted to demonstrate the reduction of wavelength conversions by employing the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 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...

متن کامل

A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks

We consider large optical networks in which nodes employ wavelength-routing switches which enable the establishment of wavelength-division-multiplexed (WDM) channels, called lightpaths, between node pairs. We propose a practical approach to solve routing and wavelength assignment (RWA) of lightpaths in such networks. A large RWA problem is partitioned into several smaller subproblems, each of w...

متن کامل

Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks

An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Multihop Wavelength Routing (WR) Wavelength Division Multiplexing (WDM) Networks simultaneously, and as a unique feature it optimises the optical layer jointly with the electrical one. Based on the proposed WG model the...

متن کامل

A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks

In the past few years, there has been growing interest in wide area \All Optical Networks" with wavelength division multiplexing (WDM), using wavelength routing. Due to the huge band-width inherent in optical ber, and the use of WDM to match user and network bandwidths, the wavelength routing architecture is an attractive candidate for future backbone transport networks. A virtual topology over...

متن کامل

Minimum Converter Wavelength Assignment in All-Optical Networks

Finding conflict-free wavelength assignments with a minimum number of required conversions for a routing of the lightpaths is one of the important tasks within the design of all-optical networks. We consider this problem in multi-fiber networks with different types of WDM systems. We give a detailed description of the problem and derive its theoretical complexity. For practical application, we ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Computer Communications

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2004