Routing with maximum EDPs and wavelength assignment with path conflict graphs

Won Jin Yoon; Duk Hun Kim; Min Young Chung; Tae Jin Lee; Hyunseung Choo

doi:10.1007/11751588_89

Routing with maximum EDPs and wavelength assignment with path conflict graphs

Won Jin Yoon, Duk Hun Kim, Min Young Chung, Tae Jin Lee, Hyunseung Choo

Sungkyunkwan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2006
Subtitle of host publication	International Conference, Proceedings - Part II
Publisher	Springer Verlag
Pages	856-865
Number of pages	10
ISBN (Print)	3540340726, 9783540340720
DOIs	https://doi.org/10.1007/11751588_89
State	Published - 2006
Event	ICCSA 2006: International Conference on Computational Science and Its Applications - Glasgow, United Kingdom Duration: 8 May 2006 → 11 May 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3981 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	ICCSA 2006: International Conference on Computational Science and Its Applications
Country/Territory	United Kingdom
City	Glasgow
Period	8/05/06 → 11/05/06

Access to Document

10.1007/11751588_89

Cite this

Yoon, W. J., Kim, D. H., Chung, M. Y., Lee, T. J., & Choo, H. (2006). Routing with maximum EDPs and wavelength assignment with path conflict graphs. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II (pp. 856-865). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3981 LNCS). Springer Verlag. https://doi.org/10.1007/11751588_89

Yoon, Won Jin ; Kim, Duk Hun ; Chung, Min Young et al. / Routing with maximum EDPs and wavelength assignment with path conflict graphs. Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Springer Verlag, 2006. pp. 856-865 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d286500aae984ed18503639ce42e7c98,

title = "Routing with maximum EDPs and wavelength assignment with path conflict graphs",

abstract = "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.",

author = "Yoon, \{Won Jin\} and Kim, \{Duk Hun\} and Chung, \{Min Young\} and Lee, \{Tae Jin\} and Hyunseung Choo",

year = "2006",

doi = "10.1007/11751588\_89",

language = "English",

isbn = "3540340726",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "856--865",

booktitle = "Computational Science and Its Applications - ICCSA 2006",

note = "ICCSA 2006: International Conference on Computational Science and Its Applications ; Conference date: 08-05-2006 Through 11-05-2006",

}

Yoon, WJ, Kim, DH, Chung, MY, Lee, TJ & Choo, H 2006, Routing with maximum EDPs and wavelength assignment with path conflict graphs. in Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3981 LNCS, Springer Verlag, pp. 856-865, ICCSA 2006: International Conference on Computational Science and Its Applications, Glasgow, United Kingdom, 8/05/06. https://doi.org/10.1007/11751588_89

Routing with maximum EDPs and wavelength assignment with path conflict graphs. / Yoon, Won Jin; Kim, Duk Hun; Chung, Min Young et al.
Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Springer Verlag, 2006. p. 856-865 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3981 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Routing with maximum EDPs and wavelength assignment with path conflict graphs

AU - Yoon, Won Jin

AU - Kim, Duk Hun

AU - Chung, Min Young

AU - Lee, Tae Jin

AU - Choo, Hyunseung

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33745914628

U2 - 10.1007/11751588_89

DO - 10.1007/11751588_89

M3 - Conference contribution

AN - SCOPUS:33745914628

SN - 3540340726

SN - 9783540340720

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 856

EP - 865

BT - Computational Science and Its Applications - ICCSA 2006

PB - Springer Verlag

T2 - ICCSA 2006: International Conference on Computational Science and Its Applications

Y2 - 8 May 2006 through 11 May 2006

ER -

Yoon WJ, Kim DH, Chung MY, Lee TJ, Choo H. Routing with maximum EDPs and wavelength assignment with path conflict graphs. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part II. Springer Verlag. 2006. p. 856-865. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11751588_89

Routing with maximum EDPs and wavelength assignment with path conflict graphs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this