Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs | Zendy

Won Jin Yoon | Zendy; Duk Hun Kim | Zendy; Min Young Chung | Zendy; TaeJin Lee | Zendy; Hyunseung Choo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs

Author(s) -

Won Jin Yoon,

Duk Hun Kim,

Min Young Chung,

TaeJin Lee,

Hyunseung Choo

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-34072-6

DOI - 10.1007/11751588_89

Subject(s) - computer science , network topology , disjoint sets , routing and wavelength assignment , routing (electronic design automation) , path (computing) , wavelength division multiplexing , greedy algorithm , enhanced data rates for gsm evolution , topology (electrical circuits) , bounded function , computer network , algorithm , wavelength , mathematics , telecommunications , discrete mathematics , combinatorics , physics , optoelectronics , mathematical analysis

The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach for EDP (BGAforEDP). The proposed algorithm outperforms by approximately 20% under the traditional fixed topology (NSFNET) and approximately 32% under random topologies, using the BGAforEDP algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research