RWA Based on Approximated Path Conflict Graphs in Optical Networks | Zendy

Zhanna Olmes | Zendy; Kun Myon Choi | Zendy; Min Young Chung | Zendy; TaeJin Lee | Zendy; Hyunseung Choo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

RWA Based on Approximated Path Conflict Graphs in Optical Networks

Author(s) -

Zhanna Olmes,

Kun Myon Choi,

Min Young Chung,

TaeJin Lee,

Hyunseung Choo

Publication year - 2005

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-25860-4

DOI - 10.1007/11424758_47

Subject(s) - computer science , disjoint sets , routing and wavelength assignment , path (computing) , enhanced data rates for gsm evolution , graph , wavelength , algorithm , routing (electronic design automation) , theoretical computer science , wavelength division multiplexing , computer network , mathematics , discrete mathematics , telecommunications , optics , physics

Among many solutions to Routing and Wavelength Assignment (RWA) problems based on Edge Disjoint Paths (EDP), the Path Conflict Graph (PCG) algorithm shows outstanding performance in terms of wavelength. In this paper, we improve the PCG algorithm by imposing limitations on the EDPs length based on the fact that the EDPs are longer than the average length for the rarely selected demands. We conclude that the running time of the PCG algorithm can be reduced by half even in the worst case scenario while expending fewer wavelengths than or equal to that of the BGAforEDP and MAX_EDP algorithms by using the proposed PCG approximation technique.

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